The filter-combiner model for memoryless synchronous stream ciphers

DOI10.1007/3-540-45708-9_34MaRDI QIDQ4409141zbMATH OpenFDO

Authors Palash Sarkar

Publication date 30 June 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2442/24420533.htm

zbMATH Keywords

cellular automatafilter-combiner modellinear feedback shift registersnonlinear combiner modelnonlinear filter modelsynchronous stream ciphers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cellular automata (computational aspects) (68Q80) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Correlation properties of combiners with memory in stream ciphers
• Enhanced Boolean functions suitable for the filter model of pseudo-random generator
• Correlation properties of combiners with memory in stream ciphers
• On the security of nonlinear filter generators
• On a resynchronization weakness in a class of combiners with memory

Cited in

(3)

• Computing shifts in 90/150 cellular automata sequences
• CAR30: a new scalable stream cipher with rule 30
• On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners

This page was built for publication: The filter-combiner model for memoryless synchronous stream ciphers

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