Cryptology ePrint Archive: Report 2021/672

PQC: R-Propping a Chaotic Cellular Automata

Pedro Hecht

Abstract: Post-quantum cryptography (PQC) has a well-deserved NIST status. Our approach (R-Propping) replaces all numeric field arithmetic with GF(2^8) field operations. This method yields both classical and quantum secure protocols. The present work is dedicated to strengthening a chaotic Wolfram Class III cellular automata and discuss its usability as a cryptographical secure PRBG (pseudorandom bit generator), a building block for stream-ciphers, hashing, and other random numbers requiring protocols.

Category / Keywords: cryptographic protocols / Post-quantum cryptography, algebraic rings, combinatorial group theory, R-propping

Date: received 23 May 2021

Contact author: qubit101 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20210525:070853 (All versions of this report)

Short URL: ia.cr/2021/672


[ Cryptology ePrint archive ]