Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
From MaRDI portal
Publication:3519549
DOI10.1007/978-3-540-69499-1_3zbMath1202.94195OpenAlexW1547783635MaRDI QIDQ3519549
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_3
symmetric functionsfunctions over finite fieldsbalanced functionshardware and software implementation(sharply) t-transitive functions
Symbolic computation and algebraic computation (68W30) Symmetric functions and generalizations (05E05) Cryptography (94A60)
Related Items (2)
De Bruijn sequences and complexity of symmetric functions ⋮ Enhanced Count of Balanced Symmetric Functions and Balanced Alternating Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating Boolean functions of cryptographic significance
- On recognizing graph properties from adjacency matrices
- Polynomials with two values
- Results on rotation symmetric polynomials over \(GF(p)\)
- Rotation Symmetric Boolean Functions –; Count and Cryptographic Properties
- Balancedness and Correlation Immunity of Symmetric Boolean Functions
- Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations
- Symmetric Boolean Functions
- Balanced Symmetric Functions Over ${\hbox{GF}}(p)$
- Graph-Based Algorithms for Boolean Function Manipulation
- Least upper bounds for the size of OBDDs using symmetry properties
- Advances in Cryptology - EUROCRYPT 2004
This page was built for publication: Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
