Chaotic pseudorandom sequences and the security of cryptosystems
The generation of pseudo-random numbers (bits) plays a critical role in a large number of applications such as statistical mechanics, numerical simulations, gaming industry, communication or cryptography. The choice of secret keys for cryptographic primitives largely depends on the quality of random...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Language: | English |
| Published: |
Springer International Publishing
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/47321/1/Chaotic%20pseudorandom%20sequences%20and%20the%20security%20of%20cryptosystems.pdf |
| _version_ | 1825929788180660224 |
|---|---|
| author | Hina, Aliyu Danladi Md Said, Mohamad Rushdan Banerjee, Santo |
| author2 | Erçetin, Şefika Şule |
| author_facet | Erçetin, Şefika Şule Hina, Aliyu Danladi Md Said, Mohamad Rushdan Banerjee, Santo |
| author_sort | Hina, Aliyu Danladi |
| collection | UPM |
| description | The generation of pseudo-random numbers (bits) plays a critical role in a large number of applications such as statistical mechanics, numerical simulations, gaming industry, communication or cryptography. The choice of secret keys for cryptographic primitives largely depends on the quality of random numbers used. These random numbers are fundamental tools in the generation of secret keys and initialization variables of encryption for cryptographic application, masking protocols, or for internet gambling. Chaotic Pseudorandom numbers were found to be very efficient in this aspect. The relevance of chaotic pseudorandom sequences in ensuring security in cryptosystems is considered, at the same time reviewing statistical tests required to make such sequences cryptographically secure. This paper intends to review the development of chaotic pseudorandom number generators through the years and the statistical tests they are required to pass as a measure of their randomness. |
| first_indexed | 2024-03-06T09:01:50Z |
| format | Book Section |
| id | upm.eprints-47321 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T09:01:50Z |
| publishDate | 2015 |
| publisher | Springer International Publishing |
| record_format | dspace |
| spelling | upm.eprints-473212021-09-04T21:28:00Z http://psasir.upm.edu.my/id/eprint/47321/ Chaotic pseudorandom sequences and the security of cryptosystems Hina, Aliyu Danladi Md Said, Mohamad Rushdan Banerjee, Santo The generation of pseudo-random numbers (bits) plays a critical role in a large number of applications such as statistical mechanics, numerical simulations, gaming industry, communication or cryptography. The choice of secret keys for cryptographic primitives largely depends on the quality of random numbers used. These random numbers are fundamental tools in the generation of secret keys and initialization variables of encryption for cryptographic application, masking protocols, or for internet gambling. Chaotic Pseudorandom numbers were found to be very efficient in this aspect. The relevance of chaotic pseudorandom sequences in ensuring security in cryptosystems is considered, at the same time reviewing statistical tests required to make such sequences cryptographically secure. This paper intends to review the development of chaotic pseudorandom number generators through the years and the statistical tests they are required to pass as a measure of their randomness. Springer International Publishing Erçetin, Şefika Şule Banerjee, Santo 2015 Book Section PeerReviewed text en http://psasir.upm.edu.my/id/eprint/47321/1/Chaotic%20pseudorandom%20sequences%20and%20the%20security%20of%20cryptosystems.pdf Hina, Aliyu Danladi and Md Said, Mohamad Rushdan and Banerjee, Santo (2015) Chaotic pseudorandom sequences and the security of cryptosystems. In: Chaos, Complexity and Leadership 2013. Springer Proceedings in Complexity . Springer International Publishing, Switzerland, pp. 163-173. ISBN 9783319097091; EISBN: 9783319097107 https://link.springer.com/chapter/10.1007/978-3-319-09710-7_13 10.1007/978-3-319-09710-7_13 |
| spellingShingle | Hina, Aliyu Danladi Md Said, Mohamad Rushdan Banerjee, Santo Chaotic pseudorandom sequences and the security of cryptosystems |
| title | Chaotic pseudorandom sequences and the security of cryptosystems |
| title_full | Chaotic pseudorandom sequences and the security of cryptosystems |
| title_fullStr | Chaotic pseudorandom sequences and the security of cryptosystems |
| title_full_unstemmed | Chaotic pseudorandom sequences and the security of cryptosystems |
| title_short | Chaotic pseudorandom sequences and the security of cryptosystems |
| title_sort | chaotic pseudorandom sequences and the security of cryptosystems |
| url | http://psasir.upm.edu.my/id/eprint/47321/1/Chaotic%20pseudorandom%20sequences%20and%20the%20security%20of%20cryptosystems.pdf |
| work_keys_str_mv | AT hinaaliyudanladi chaoticpseudorandomsequencesandthesecurityofcryptosystems AT mdsaidmohamadrushdan chaoticpseudorandomsequencesandthesecurityofcryptosystems AT banerjeesanto chaoticpseudorandomsequencesandthesecurityofcryptosystems |