Designing conflict free cellular automata-based PRNG

MaRDI QIDQ5010302zbMATH OpenFDO

Authors Mirosław Szaban, Franciszek Seredynski

Publication date 25 August 2021

Full work available at URL http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-13-number-3-2018/jca-13-3-p-229-246/

zbMATH Keywords

balancecellular automataBoolean functioncryptographypseudorandom-number generator

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

Recommendations

• Parallel Processing and Applied Mathematics
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• Random number generation using decimal cellular automata
• scientific article; zbMATH DE number 7385042
• scientific article; zbMATH DE number 2040658

Cited in

(1)

• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony

This page was built for publication: Designing conflict free cellular automata-based PRNG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010302)