Graph Theoretic Approach to Randomness Test Based on the Overlapping Blocks

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

International Journal of Information Security Science
Volume:12 Issue:2
Graph Theoretic Approach to Randomness Test Based on the Overlapping Blocks

Graph Theoretic Approach to Randomness Test Based on the Overlapping Blocks

Pages : 42-52

View : 29 | Download : 24

Publication Date : 2023-06-28

Article Type : Research Paper

Abstract :Cryptographic parameters such as secret keys, should be chosen randomly and at the same time it should not be so difficult to reproduced them when necessary. Because of this, pseudorandom bit insert ignore into journalissuearticles values(or number); generators take the role of true random generators. Outputs of pseudorandom generators, although they are produced through some deterministic process, should be random looking, that is not distinguishable from true random sequences. In other word they should not follow any pattern. In this paper we propose a new approach using graph theory, to determine when to expected a fixed pattern to appear in a random sequence for the fist time. Using these expected values and comparing them with the observed values a randomness test can be defined. In this work patters are traced through the sequence in an overlapping manner.
Keywords : Cryptography, Statistical Randomness Testing, NIST Test Suite, Recursion

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.