

A004491


Number of bent functions of 2n variables.


1




OFFSET

0,1


COMMENTS

The old entry with this sequence number was a duplicate of A004483.


REFERENCES

Carlet, C. & Mesnager, S., Four decades of research on bent functions, Designs, Codes and Cryptography, January 2016, Volume 78, Issue 1, pp. 550.
J. F. Dillon, Elementary Hadamard Difference Sets, Ph. D. Thesis, Univ. Maryland, 1974.
J. F. Dillon, Elementary Hadamard Difference Sets, in Proc. 6th SouthEastern Conf. Combin. Graph Theory Computing (Utilitas Math., Winnipeg, 1975), pp. 237249.
F. J. MacWilliams and N. J. A. Sloane, The Theory of ErrorCorrecting Codes, Elsevier/North Holland, 1977. [Section 5 of Chap. 14 deals with bent functions. For a(2) see page 418.]
B. Preneel, Analysis and design of cryptographic hash functions, Ph. D. thesis, Katholieke Universiteit Leuven, Belgium, 1993. [Confirms a(3).]


LINKS



CROSSREFS

See A099090 for a normalized version.


KEYWORD

nonn,hard,nice,more


AUTHOR

N. J. A. Sloane, Sep 23 2008, based on emails from Philippe Langevin, Gregor Leander and Pante Stanica.


EXTENSIONS

a(4) found in 2008 by Philippe Langevin and Gregor Leander.


STATUS

approved



