An Efficient n ×n Boolean Mapping Using Additive Cellular Automata

DOI10.1007/978-3-540-79992-4_22MaRDI QIDQ3541759zbMATH OpenOpenAlexFDO

Authors Sourav Das, Dipanwita Roy Chowdhury

Publication date 27 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79992-4_22

zbMATH Keywords

pseudo-random number generatoradditive cellular automata

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Dynamical aspects of cellular automata (37B15)

Recommendations

• Cryptographically suitable maximum length cellular automata
• Maximum length cellular automaton sequences and its application
• scientific article; zbMATH DE number 691490
• Advances on random sequence generation by uniform cellular automata
• scientific article; zbMATH DE number 7301769

Cites work

• Analysis of periodic and intermediate boundary 90/150 cellular automata
• On the generation of high-quality random numbers by two-dimensional cellular automata

Cited in

(1)

• scientific article; zbMATH DE number 4070330 (Why is no real title available?)

This page was built for publication: An Efficient n ×n Boolean Mapping Using Additive Cellular Automata

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