A new representation of boolean functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1719, Issue , 1999, Pages 94-103

  Carlet, Claude ^a,b   Guillot, Philippe ^c  

^a INRIA   (France)

^b UNIVERSITÉ DE CAEN   (France)

^c THALES   (France)

Author keywords

Boolean function; Cryptography; Fourier spectrum

Indexed keywords

ALGEBRA; CODES (SYMBOLS); CRYPTOGRAPHY;

COMPLEX VALUED FUNCTIONS; CRYPTOGRAPHIC PROPERTIES; FOURIER SPECTRA;

BOOLEAN FUNCTIONS;

EID: 84957706381     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46796-3_10     Document Type: Conference Paper

References (10)

1. C. Carlet. Generalized Partial Spreads, IEEE Transactions on Information Theory vol 41 (1995) 1482-1487
2. C. Carlet and P. Guillot. A characterization of binary bent functions, Journal of Combinatorial Theory, Series A, Vol. 76, No. 2 (1996) 328-335
3. J. F. Dillon. Elementary Hadamard Difference sets, Ph. D. Thesis, Univ. of Maryland (1974).
4. C.J.A. Jansen. Investigation on Nonlinear Streamcipher Systems: Construction and Evaluation Methods Philips (1989).
5. J.P.S. Kung. Source Book in Matroïd Theory, Birkhauser (1986).
6. Meier, W. and O. Staffelbach. Nonlinearity Criteria for Cryptographic Functions, Advances in Cryptology, EUROCRYPT' 89, Lecture Notes in Computer Science 434, 549-562, Springer Verlag (1990).
7. F. J. Mac Williams and N. J. Sloane. The theory of error-correcting codes, Amsterdam, North Holland 1977.
8. Gian-Carlo Rota. On the foundations of Combinatorial Theory; Springer Verlag (1964); reprint in [5].
9. O. S. Rothaus. On bent functions, J. Comb. Theory, 20A (1976) 300- 305.
10. J. H. Van Lint. Coding Theory, Springer Verlag 201 (1971).