A brief and understandable guide to pseudo-random number generators and specific models for security

Luengo, Elena Almaraz

doi:10.1214/22-ss136

Cited by 9 publications

(8 citation statements)

References 154 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Sequences with p-values greater or lower than these bounds were said to exhibit poor pseudorandomness [27,28]. At this point, we applied the Diehard battery of tests to a series of sequences generated using TinyJambu.…”

Section: The Diehard Battery Of Pseudorandomness Testsmentioning

confidence: 99%

“…In fact, the p-values may fluctuate but not trespass these bounds, indicating good statistical properties or good pseudorandomness characteristics. In this work, we established our boundaries in the following margins: 0.03 < p-values < 0.97 Sequences with p-values greater or lower than these bounds were said to exhibit poor pseudorandomness [27,28]. At this point, we applied the Diehard battery of tests to a series of sequences generated using TinyJambu.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Security Analysis of the Symmetric Cryptosystem TinyJambu

Fúster-Sabater,

Pazo-Robles

2024

Symmetry

View full text Add to dashboard Cite

Symmetric cryptography provides the best examples of cryptosystems to be applied in lightweight environments (e.g., IoT). A representative example is the cryptosystem TinyJambu, one of the ten finalists in the NIST Lightweight Cryptography Standardization Project. It is an authentication encryption with associated data scheme that is extremely lightweight and fast. In this work, we analyze the security of TinyJambu from two distinct and non-symmetric points of view: (1) the improvement of the best cryptanalytical attack found in the literature and (2) a randomness analysis of the generated sequences. Concerning item (1), we launched a differential forgery attack with probability 2−65.9487, which was improved considerably compared with previous numerical results. Concerning item (2), we analyzed the degree of randomness of the TinyJambu keystream sequences with a complete and powerful battery of statistical tests. This non-symmetric study shows the weakness of TinyJambu against cryptanalytic attacks as well as the strength of TinyJambu against statistical analysis.

show abstract

Section: The Diehard Battery Of Pseudorandomness Testsmentioning

confidence: 99%

mentioning

confidence: 99%

Security Analysis of the Symmetric Cryptosystem TinyJambu

Fúster-Sabater,

Pazo-Robles

2024

Symmetry

View full text Add to dashboard Cite

show abstract

“…They are used in the field of statistics and cryptography. A paper that describes pseudo-random numbers and generation methods in-depth is [19].…”

Section: Classification Of Random Numbersmentioning

confidence: 99%

Cryptographically Secured Pseudo-Random Number Generators: Analysis and Testing with NIST Statistical Test Suite

Almaraz Luengo,

Román Villaizán

2023

Mathematics

View full text Add to dashboard Cite

There are several areas of knowledge in which (pseudo-)random numbers are necessary, for example, in statistical–mathematical simulation or in cryptography and system security, among others. Depending on the area of application, it will be necessary that the sequences used meet certain requirements. In general, randomness and uniformity conditions are required in the generated sequences, which are checked with statistical tests, and conditions on sequence unpredictability if the application is in security. In the present work, a literature review on cryptographically secure pseudo-random number generators (CSPRNGs) is carried out, they are implemented, and a critical analysis of their statistical quality and computational efficiency is performed. For this purpose, different programming languages will be used, and the sequences obtained will be checked by means of the NIST Statistical Test Suite (NIST STS). In addition, a user’s guide will be provided to allow the selection of one generator over another according to its statistical properties and computational implementation characteristics.

show abstract

“…For such an encryption process, we require a lengthy bit of binary strings, coming from pseudo random binary sequence generators. These efficient generators are the necessary device for the privacy of the system [17,22]. The encryption and decryption, of such ciphers, are executed based on XOR operation with a lengthy key stream.…”

Section: Introductionmentioning

confidence: 99%

The Improvement of Period of Pseudo Random Number Sequence: an Algebraic Approach

Ghosh

2023

Preprint

View full text Add to dashboard Cite

Linear feedback shift registers are the fundamental structure of pseudo random number generators that are used in formation of channel key. Many methods were proposed for determining linear recurring sequences generated by Linear Feedback Shift Registers to enhance the period. In view of large scale application of this sequence in security and privacy, a clocked controlled linear feedback shift register has been introduced, known as dynamic linear feedback shift register. In this article, we emphasis on dynamic linear feedback shift register scheme using combinatorial design having constant block length and algebraic structure to enhance the period. Such sequence has the vulnerability from attack. Our proposal for designing dynamic linear feedback shift register involves primitive polynomial over a finite fields of prime power. A counter example shown the practical implication of our theory that improve the period of the sequence than existing scheme. Finally an effort was thru on properties of the generated sequence in terms of security aspect. Mathematics Subject Classification Code[2020]: 68W30, 12L15.

show abstract

A brief and understandable guide to pseudo-random number generators and specific models for security

Cited by 9 publications

References 154 publications

Security Analysis of the Symmetric Cryptosystem TinyJambu

Security Analysis of the Symmetric Cryptosystem TinyJambu

Cryptographically Secured Pseudo-Random Number Generators: Analysis and Testing with NIST Statistical Test Suite

The Improvement of Period of Pseudo Random Number Sequence: an Algebraic Approach

Contact Info

Product

Resources

About