Quadratic functions with prescribed spectra
From MaRDI portal
Publication:1934217
DOI10.1007/s10623-012-9690-6zbMath1284.11156OpenAlexW1975768884MaRDI QIDQ1934217
Wilfried Meidl, Alev Topuzoğlu
Publication date: 28 January 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00614440/file/92.pdf
trace formslinear complexityself-reciprocal polynomialsquadratic functionsplateaued functionssemi-bent functions
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06)
Related Items
Spectra of a class of quadratic functions: average behaviour and counting functions, Some enumeration results on trace forms of low radical over finite fields of characteristic two, Unnamed Item, Design methods for semi-bent functions, Idempotent and \(p\)-potent quadratic functions: distribution of nonlinearity and co-dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the construction of bent vectorial functions
- A construction of weakly and non-weakly regular bent functions
- Factorization of a class of polynomials over finite fields
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
- Construction of bent functions from near-bent functions
- Highly degenerate quadratic forms over finite fields of characteristic 2
- On the construction of irreducible self-reciprocal polynomials over finite fields
- A new characterization of semi-bent and bent functions on finite fields
- Trace forms over finite fields of characteristic 2 with prescribed invariants
- A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
- On Bent and Semi-Bent Quadratic Boolean Functions
- Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Bent Functions of Maximal Degree
- Shift-register synthesis and BCH decoding
