Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Des Codes Cryptogr

Search In Journal Title:

Abbravation: Designs, Codes and Cryptography

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s12265-011-9312-0

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

Bent functions embedded into the recursive framewo

Authors: Hans Dobbertin Gregor Leander
Publish Date: 2008/04/08
Volume: 49, Issue: 1-3, Pages: 3-22
PDF Link

Abstract

Suppose that n is even Let mathbbF 2 denote the twoelement field and mathbbZ the set of integers Bent functions can be defined as ± 1valued functions on mathbbF 2n with ± 1valued Fourier transform More generally we call a mapping f on mathbbF 2n a mathbbZ bent function if both f and its Fourier transform widehatf are integervalued mathbbZ bent functions f are separated into different levels depending on the size of the maximal absolute value attained by f and widehatf It is shown how mathbbZ bent functions of lower level can be built up recursively by gluing together mathbbZ bent functions of higher level This recursion comes down at level zero containing the usual bent functions In the present paper we start to study bent functions in the framework of mathbbZ bent functions and give some guidelines for further research

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Composition of recursions and nonlinear complexity of periodic binary sequences
  2. Practical-time attacks against reduced variants of MISTY1
  3. On the largest affine sub-families of a family of NFSR sequences
  4. The dimension of subcode-subfields of shortened generalized Reed–Solomon codes
  5. On explicit factors of cyclotomic polynomials over finite fields
  6. Two classes of optimal two-dimensional OOCs
  7. Sequences with small correlation
  8. Improved algorithms for finding low-weight polynomial multiples in $$\mathbb {F}_{2}^{}[x]$$ and some cryptographic applications
  9. A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
  10. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
  11. A new table of permutation codes
  12. Nonexistence of CW (110, 100)
  13. Point compression for the trace zero subgroup over a small degree extension field
  14. The Diffie–Hellman problem and generalization of Verheul’s theorem
  15. Modular independence and generator matrices for codes over $${\mathbb {Z}_m}$$
  16. Improved lower bounds on sizes of single-error correcting codes
  17. A combinatorial problem related to sparse systems of equations
  18. Some results concerning cryptographically significant mappings over GF(2 n )
  19. A note on the reducibility of binary affine polynomials
  20. Primitive normal bases for quartic and cubic extensions: a geometric approach
  21. Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$
  22. Some cyclic codes of length 2 p n
  23. On the correlation distribution of Delsarte–Goethals sequences
  24. Algebraic decoding of folded Gabidulin codes
  25. Inner balance of symmetric designs
  26. On the construction of Griesmer codes of dimension 5
  27. Applications of representation theory to wireless communications
Search Result: