Design and implementation of a novel cryptographically secure pseudorandom number generator
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913753595904000 |
|---|---|
| author | Di Mauro, Juan Salazar, Eduardo Scolnik, Hugo D. |
| author_facet | Di Mauro, Juan Salazar, Eduardo Scolnik, Hugo D. |
| contents | The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random sequences, that is compact and easy to implement in practice, of portable design and offering reasonable execution times. Our procedure achieves those objectives through the use of a sequence of modular exponentiations followed by the application of Feistel-like boxes that mix up bits using a nonlinear function. The results of extensive statistical tests on sequences of about 2^40 bits in size generated by our algorithm are also presented. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_17767 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Design and implementation of a novel cryptographically secure pseudorandom number generator Di Mauro, Juan Salazar, Eduardo Scolnik, Hugo D. Cryptography and Security Numerical Analysis Number Theory 65C10, 11T71 D.4.6; E.3 The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random sequences, that is compact and easy to implement in practice, of portable design and offering reasonable execution times. Our procedure achieves those objectives through the use of a sequence of modular exponentiations followed by the application of Feistel-like boxes that mix up bits using a nonlinear function. The results of extensive statistical tests on sequences of about 2^40 bits in size generated by our algorithm are also presented. |
| title | Design and implementation of a novel cryptographically secure pseudorandom number generator |
| topic | Cryptography and Security Numerical Analysis Number Theory 65C10, 11T71 D.4.6; E.3 |
| url | https://arxiv.org/abs/2503.17767 |