Synthesis of cryptographic interleaved sequences by means of linear cellular automata

DOI10.1016/j.aml.2009.03.018zbMath1171.94346OpenAlexW2079525363WikidataQ61763355 ScholiaQ61763355MaRDI QIDQ735108

Pino Caballero-Gil, Amparo Fúster-Sabater

Publication date: 14 October 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10261/24210

zbMATH Keywords

linearizationcellular automatacryptographydifference equationinterleaved sequence

Mathematics Subject Classification ID

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

Related Items (9)

SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER ⋮ Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice ⋮ Structure and reversibility of 2D hexagonal cellular automata ⋮ Unnamed Item ⋮ 2D Triangular von Neumann Cellular Automata with Periodic Boundary ⋮ Chaotic Cellular Automata with Cryptographic Application ⋮ Linear complexity of generalized sequences by comparison of PN-sequences ⋮ REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES ⋮ Replication of spatial patterns with reversible and additive cellular automata

Cites Work

• Run distribution in nonlinear binary generators.
• Theory of cellular automata: a survey
• Concatenated Automata in Cryptanalysis of Stream Ciphers
• Theory and applications of q-ary interleaved sequences
• Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences
• Modelling of Complex Cryptographic Systems in Terms of Simple Cellular Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthesis of cryptographic interleaved sequences by means of linear cellular automata