CFA: A New Family of Hybrid CA-Based PRNGs | Zendy

Fatima Ezzahra | Zendy; Anas Sadak | Zendy; Charifa Hanin | Zendy; Bouchra Echandouri | Zendy; Fouzia Omary | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

CFA: A New Family of Hybrid CA-Based PRNGs

Author(s) -

Fatima Ezzahra,

Anas Sadak,

Charifa Hanin,

Bouchra Echandouri,

Fouzia Omary

Publication year - 2021

Publication title -

security and communication networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.446

H-Index - 43

eISSN - 1939-0114

pISSN - 1939-0122

DOI - 10.1155/2021/6640052

Subject(s) - computer science , randomness , pseudorandom number generator , theoretical computer science , cellular automaton , modular design , hash function , block cipher , cryptography , block (permutation group theory) , pseudorandom generator , algorithm , programming language , mathematics , statistics , geometry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research