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
Recommendations
Analysis of algorithms (68W40) Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Combinatorial Designs
- Title not available (Why is that?)
- Endomorphisms and automorphisms of the shift dynamical system
- How to share a secret
- Solving the parity problem in one-dimensional cellular automata
- How to share a secret with cheaters
- Tesselations with local transformations
- Title not available (Why is that?)
- The Probability of Relatively Prime Polynomials
- A secret sharing scheme based on cellular automata
- Title not available (Why is that?)
- Cellular automata based S-boxes
- Computing the periods of preimages in surjective cellular automata
- Enumerating orthogonal Latin squares generated by bipermutive cellular automata
Cited In (3)
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)
