Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/2454Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Divyanjali, Ankur and | - |
| dc.contributor.author | Bhardwaj, Trishansh | - |
| dc.date.accessioned | 2025-01-06T09:15:36Z | - |
| dc.date.available | 2025-01-06T09:15:36Z | - |
| dc.date.issued | 2015 | - |
| dc.identifier.citation | 10.1109/ACCT.2015.90 | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/2454 | - |
| dc.description | NITW | en_US |
| dc.description.abstract | In 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.iso | en | en_US |
| dc.publisher | International Conference on Advanced Computing and Communication Technologies, ACCT | en_US |
| dc.subject | New Algorithm | en_US |
| dc.subject | NIST statistical test report | en_US |
| dc.title | Pseudo Random Bit Generation Using Arithematic Progression | en_US |
| dc.type | Other | en_US |
| Appears in Collections: | Computer Science & Engineering | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Pseudo_Random_Bit_Generation_Using_Arithematic_Progression.pdf | 899.87 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.