Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2454
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDivyanjali, Ankur and-
dc.contributor.authorBhardwaj, Trishansh-
dc.date.accessioned2025-01-06T09:15:36Z-
dc.date.available2025-01-06T09:15:36Z-
dc.date.issued2015-
dc.identifier.citation10.1109/ACCT.2015.90en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2454-
dc.descriptionNITWen_US
dc.description.abstractIn our day-today life, we performs a lot of tasks that involves direct or indirect use of random numbers e.g. games, lotteries, simulations and most important cryptography and data communication security. Although, the field of pseudo random number generation is important, it is very difficult to find a good generator for several of applications. In present manuscript, we explore the possibility of a new Pseudorandom Random Number Generator and gives its testing results on NIST test battery.en_US
dc.language.isoenen_US
dc.publisherInternational Conference on Advanced Computing and Communication Technologies, ACCTen_US
dc.subjectNew Algorithmen_US
dc.subjectNIST statistical test reporten_US
dc.titlePseudo Random Bit Generation Using Arithematic Progressionen_US
dc.typeOtheren_US
Appears in Collections:Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
Pseudo_Random_Bit_Generation_Using_Arithematic_Progression.pdf899.87 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.