Inversion of Mutually Orthogonal Cellular Automata

DOI10.1007/978-3-319-99813-8_33zbMATH Open1515.68196OpenAlexW2888423035MaRDI QIDQ6163604FDOQ6163604

Authors Luca Mariot, Alberto Leporati

Publication date 30 June 2023

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99813-8_33

zbMATH Keywords

cellular automataLatin squaressecret-sharing schemesde Bruijn graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Mutually orthogonal Latin squares based on cellular automata
• Enumerating orthogonal Latin squares generated by bipermutive cellular automata
• A verifiable multi-secret sharing scheme based on cellular automata
• scientific article; zbMATH DE number 1361495
• Cellular automaton cryptosystems

Cites work

• scientific article; zbMATH DE number 6473829 (Why is no real title available?)
• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• scientific article; zbMATH DE number 21231 (Why is no real title available?)
• A secret sharing scheme based on cellular automata
• Cellular automata based S-boxes
• Combinatorial Designs
• Computing the periods of preimages in surjective cellular automata
• Endomorphisms and automorphisms of the shift dynamical system
• Enumerating orthogonal Latin squares generated by bipermutive cellular automata
• How to share a secret
• How to share a secret with cheaters
• Solving the parity problem in one-dimensional cellular automata
• Tesselations with local transformations
• The Probability of Relatively Prime Polynomials

Cited in

(4)

• scientific article; zbMATH DE number 4074491 (Why is no real title available?)
• Enumeration of maximal cycles generated by orthogonal cellular automata
• Heuristic search of (semi-)bent functions based on cellular automata
• Enumerating orthogonal Latin squares generated by bipermutive cellular automata

This page was built for publication: Inversion of Mutually Orthogonal Cellular Automata

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