CFA: A New Family of Hybrid CA-Based PRNGs

Fatima Ezzahra Ziani,Anas Sadak,Bouchra Echandouri,Fouzia Omary,Charifa Hanin,Mamoun Alazab

doi:10.1155/2021/6640052

Fatima Ezzahra Ziani, Anas Sadak + Show 4 more

Open Access

https://doi.org/10.1155/2021/6640052

Copy DOI

Abstract

In this article, a new Pseudorandom Number Generator (PRNG) construction is proposed. It is based on cellular automata (CAs) and comprises other cryptographic primitives organized as blocks. Each of these blocks has a purpose and serves toward obtaining a higher level of randomness. The construction described is modular, and each of its blocks can be replaced, modified, or adapted according to the user, the application, or the level of randomness required. The authors first describe a general structure and the design principles behind each of the components. Next, a concrete example using the SHA-3 hash function, a hybrid cellular automaton, and the AES block cipher is provided. Then, the security analysis and the statistical properties for this specific instance of the scheme are presented.

Highlights

Designing cryptographic primitives that achieve security strength and satisfy all of the cryptographic properties is a hard task
It is assumed that the security of cryptographic primitives translates to the Pseudorandom Number Generator (PRNG) [14]
According to [15], the following points represent some of the reasons that lead to a compromised PRNG: (i) Entropy overestimation and guessable starting points (ii) Chosen-Input Attacks (iii) Side-Channel Attacks (iv) Direct Cryptanalytic attacks e sponge construction starts with an absorbing phase followed by a squeezing phase

Summary

Introduction

Designing cryptographic primitives that achieve security strength and satisfy all of the cryptographic properties is a hard task. The development of cryptanalysis techniques makes it difficult for designers to build new primitives with a high security level. Some cryptographic properties are conflicting like, for example, nonlinearity and correlation [1]. Erefore, a compromise between cryptographic properties should be found according to the security level the designer wants to achieve. Many cryptographic applications make use of random numbers. For costs reasons, not all these applications use truly random bits generated from physical sources. Is cryptographic mechanism tries to generate sequences that are hard to distinguish from truly random sequences A pseudorandom number generator is used. is cryptographic mechanism tries to generate sequences that are hard to distinguish from truly random sequences

Methods

Results

Conclusion