De Bruijn sequences and complexity of symmetric functions
From MaRDI portal
Publication:662186
DOI10.1007/s12095-011-0054-2zbMath1251.94038MaRDI QIDQ662186
Christelle Rovetta, Marc Mouffron
Publication date: 21 February 2012
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-011-0054-2
symmetric functions; hardware implementation; multivalued function; De Bruijn sequences; functions over finite sets; MDD; multivalued decision diagram
94A60: Cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact OBDD bounds for some fundamental functions
- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
- Symmetric Boolean Functions
- Graph-Based Algorithms for Boolean Function Manipulation
- Branching Programs and Binary Decision Diagrams
- Least upper bounds for the size of OBDDs using symmetry properties
- Keccak
- Extended BDD-Based Cryptanalysis of Keystream Generators