Cryptoresistant generator of binary key sequences on the basis of cellular automata

MaRDI QIDQ3091199zbMATH OpenFDO

Authors L. O. Chajka, V. V. Zhykharevych, S. E. Ostapov

Publication date 8 September 2011

zbMATH Keywords

cellular automatabinary sequenceinitial statepseudorandom number generator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2077097
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 2184880
• scientific article; zbMATH DE number 1461547
• An asymptotically perfect pseudorandom generator

Cited in

(10)

• scientific article; zbMATH DE number 2040658 (Why is no real title available?)
• Pseudo-random key sequence generator based on triple sets of bent-functions
• scientific article; zbMATH DE number 2077097 (Why is no real title available?)
• Improvement and analysis of a pseudo-random bit generator by means of cellular automata
• High-speed pseudorandom sequence generators based on cellular automata
• Synthesis of cryptographic interleaved sequences by means of linear cellular automata
• Design and validation of a regenerator of binary sequences cryptographically safe based on Goppa codes
• An improved genetic algorithm for developing deterministic OTP key generator
• Combined pseudorandom sequence generator based on cellular automata
• scientific article; zbMATH DE number 1107686 (Why is no real title available?)

This page was built for publication: Cryptoresistant generator of binary key sequences on the basis of cellular automata

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