Abstract

We have recently developed a chaos-based stream cipher based on augmented Lorenz equations as a star network of Lorenz subsystems. In our method, the augmented Lorenz equations are used as a pseudorandom number generator. In this study, we propose a new method based on the augmented Lorenz equations for generating binary pseudorandom numbers and evaluate its security using the statistical tests of SP800-22 published by the National Institute for Standards and Technology in comparison with the performances of other chaotic dynamical models used as binary pseudorandom number generators. We further propose a faster version of the proposed method and evaluate its security using the statistical tests of TestU01 published by L’Ecuyer and Simard.

Highlights

  • One-time pad cryptography as the most secure version of cryptosystems is a very safe symmetrickey cryptographic method [Shannon, 1949], wherein the secret key consists of a sequence of random numbers, the length of which is equal to that of the plaintext to be encrypted, and is supposed to be securely shared by a sender traditionally called Alice and receiver called Bob

  • We evaluate the security of the augmented Lorenz (AL) equations as a binary pseudorandom generator in comparison with those of the logistic map and a star network of Rossler oscillators

  • We have evaluated the randomness of the pseudorandom numbers generated from the AL equations in terms of the statistical tests of SP800-22 published by National Institute of Standards and Technology (NIST) in comparison with those of the augmented Rossler (AR) equations and the logistic map

Read more

Summary

Introduction

One-time pad cryptography as the most secure version of cryptosystems is a very safe symmetrickey cryptographic method [Shannon, 1949], wherein the secret key consists of a sequence of random numbers, the length of which is equal to that of the plaintext to be encrypted, and is supposed to be securely shared by a sender traditionally called Alice and receiver called Bob. This weak point can be overcome by quantum key distribution (QKD), a newly emerging technology for secret-key distribution [Bennett & Brassard, 1984; Ekert, 1991; Gisin et al, 2002]

Methods
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.