On “bent” functions
Reads0
Chats0
TLDR
The polynomial degree of a bent function P ( x ) is studied, as are the properties of the Fourier transform of (−1) P(x) , and a connection with Hadamard matrices.About:
This article is published in Journal of Combinatorial Theory, Series A.The article was published on 1976-05-01 and is currently open access. It has received 1211 citations till now. The article focuses on the topics: Bent function & Fourier transform.read more
Citations
More filters
Book ChapterDOI
Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Boolean Functions for Cryptography and Error-Correcting Codes
TL;DR: Encryption-decryption is the most ancient cryptographic activity, but its nature has deeply changed with the invention of computers, because the cryptanalysis (the activity of the third person, the eavesdropper, who aims at recovering the message) can use their power.
Book
Analysis of Boolean Functions
TL;DR: This text gives a thorough overview of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry, and includes a "highlight application" such as Arrow's theorem from economics.
Journal ArticleDOI
Pseudo-random sequences and arrays
TL;DR: A simple description of pseudo-random sequences, or maximal-length shift-register sequences, and two-dimensional arrays of area n = 2lm- 1 with the same property.
Journal ArticleDOI
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
TL;DR: The "coding theory" point of view for studying the existence of almost bent functions is developed, showing explicitly the links with cyclic codes and new characterizations are given by means of associated Boolean functions.
Journal ArticleDOI
The Geometry of Two-Weight Codes
R. Calderbank,William M. Kantor +1 more
TL;DR: On etudie les relations entre les codes [n,k] lineaires a deux poids, les ensembles projectifs et certains graphes fortement reguliers as mentioned in this paper.
References
More filters
Journal ArticleDOI
A family of difference sets in non-cyclic groups
TL;DR: A construction is given for difference sets in certain non-cyclic groups with the parameters v, k, λ, n, which has minus one as a multiplier for every prime power q and every positive integer s.