Invertible shift-invariant transformations on binary arrays

DOI10.1016/0096-3003(94)90087-6MaRDI QIDQ1332378zbMATH OpenOpenAlexFDO

Authors Joan Daemen, René Govaerts, Joos Vandewalle

Publication date 12 September 1994

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(94)90087-6

zbMATH Keywords

binary shift-invariant transformations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 69502
• The invertibility of the XOR of rotations of a binary word
• scientific article; zbMATH DE number 1979303

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 503330 (Why is no real title available?)
• scientific article; zbMATH DE number 697803 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• Communication Theory of Secrecy Systems*
• Invertible cellular automata: A review
• Tesselations with local transformations

Cited in

(6)

• Heuristic search of (semi-)bent functions based on cellular automata
• The invertibility of the XOR of rotations of a binary word
• Cellular automata based S-boxes
• scientific article; zbMATH DE number 6028107 (Why is no real title available?)
• Insights gained after a decade of cellular automata-based cryptography
• Enumeration of maximal cycles generated by orthogonal cellular automata

This page was built for publication: Invertible shift-invariant transformations on binary arrays

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