Paper 2021/672 Original: eprint.iacr.org/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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2021-05-25: last updated
2021-05-25: published
Short URL
https://ia.cr/2021/672
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/672,
      author = {Pedro Hecht},
      title = {PQC: R-Propping a Chaotic Cellular Automata},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/672},
      year = {2021},
      url = {https://eprint.iacr.org/2021/672}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.