De Bruijn sequences and complexity of symmetric functions

DOI10.1007/s12095-011-0054-2zbMath1251.94038OpenAlexW1983827543MaRDI 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

zbMATH Keywords

symmetric functionshardware implementationmultivalued functionDe Bruijn sequencesfunctions over finite setsMDDmultivalued decision diagram

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• Keccak

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

This page was built for publication: De Bruijn sequences and complexity of symmetric functions