Abstract
This paper introduces an algebraic cryptanalysis of a random number generator (RNG) based on a chaotic oscillator. An attack system is proposed to discover the security weaknesses of the chaos-based RNG. Convergence of the attack system is proved using master slave synchronization scheme where the only information available are the structure of the RNG and a scalar time series observed from the chaotic oscillator. Simulation and numerical results verifying the feasibility of the attack system are given. The RNG does not fulfill NIST-800-22, Diehard and Big Crush statistical test suites, the previous and the next bit can be predicted, while the same output bit sequence of the RNG can be reproduced.
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 callDisclaimer: 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.
