Abstract
In this study, an algebraic security analysis of a random number generator (RNG) which is built on a double-scroll chaotic circuit is put forward. An attack system is proposed to discover the security weaknesses of the RNG. The proposed attack system is proved to be valid by showing its convergence to the targeted system. Here, a master-slave synchronization scheme, which takes only the RNG structure and a scalar time series obtained from the chaotic oscillator as inputs, is applied. Simulation and numerical results verifying the feasibility of the attack system are given. The RNG does not fulfill Diehard and Big Crush statistical test suites, the previous and the next bit can be predicted, and 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.
