Bent functions in the partial spread class generated by linear recurring sequences
DOI10.1007/s10623-022-01097-1OpenAlexW4291197261WikidataQ113903983 ScholiaQ113903983MaRDI QIDQ2678978
Luca Mariot, Stjepan Picek, Maximilien Gadouleau
Publication date: 18 January 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08705
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80) Polynomials over finite fields (11T06) Boolean functions (06E30) Finite partial geometries (general), nets, partial spreads (51E14) Boolean functions (94D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Four decades of research on bent functions
- On ``bent functions
- Latin hypercubes and cellular automata
- Cubic bent functions outside the completed Maiorana-McFarland class
- Mutually orthogonal Latin squares based on cellular automata
- Hyper-bent functions and cyclic codes
- On the ranks of bent functions
- Discriminants, resultants, and multidimensional determinants
- A family of difference sets in non-cyclic groups
- The Probability of Relatively Prime Polynomials
- Boolean Functions for Cryptography and Coding Theory
- Bent Functions
- Computing the periods of preimages in surjective cellular automata
This page was built for publication: Bent functions in the partial spread class generated by linear recurring sequences