A Survey on Complexity Measures for Pseudo-Random Sequences-Reference-Cited by-同舟云学术

A Survey on Complexity Measures for Pseudo-Random Sequences

Published:2024-06-13 Issue:2 Volume:8 Page:25
ISSN:2410-387X
Container-title:Cryptography
language:en
Short-container-title:Cryptography

Author:

Li Chunlei¹^ORCID

Affiliation:

1. Department of Informatics, University of Bergen, 5020 Bergen, Norway

Abstract

Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements on the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical computer science and of practical interest in cryptography. This survey reviews notable research from the past four decades on the linear, quadratic and maximum-order complexities of pseudo-random sequences, and their relations with Lempel–Ziv complexity, expansion complexity, 2-adic complexity and correlation measures.

Funder

Research Council of Norway

Publisher

MDPI AG

Link

https://www.mdpi.com/2410-387X/8/2/25/pdf

Reference74 articles.

1. Ristenpart, T., and Yilek, S. (March, January 28). When good randomness goes bad: Virtual machine reset vulnerabilities and hedging deployed cryptography. Proceedings of the Network and Distributed System Security (NDSS) Symposium, San Diego, CA, USA.

2. Ishai, Y., and Rijmen, V. (2019). An analysis of NIST SP 800-90A. Advances in Cryptology—EUROCRYPT 2019, Springer International Publishing.

3. Bernstein, D.J., Lange, T., and Niederhagen, R. (2015). Dual EC: A standardized back door. Cryptol. ePrint Arch., 767. Available online: https://eprint.iacr.org/2015/767.

4. Tang, Q., and Teague, V. (2024). On the possibility of a backdoor in the Micali-Schnorr generator. Public-Key Cryptography—PKC 2024, Springer Nature.

5. Barker, E., and Kelsey, J. (2015). Recommendation for Random Number Generation Using Deterministic Random Bit Generators, NIST (National Institute of Standards and Technology). Special Publication.