A randomised algorithm for checking the normality of cryptographic Boolean functions

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 51-66

  Braeken, An ^a   Wolf, Christopher ^a   Preneel, Bart ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Asymmetric Monte Carlo; Boolean functions; Cryptography; Normality

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; MONTE CARLO METHODS;

CRYPTOGRAPHIC BOOLEAN FUNCTIONS; HIGHER DIMENSIONS; MONTE CARLO ALGORITHMS; NORMALITY; RANDOMISED ALGORITHMS; SECOND PHASE; TIME COMPLEXITY;

BOOLEAN FUNCTIONS;

EID: 84901065697     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_7     Document Type: Conference Paper

References (12)

1. Canteaut, Anne; Daum, Magnus; Dobbertin, Hans; and Leander, Gregor (2003). Normal and non-normal bent functions. In WCC03. 19 pages.
2. th May, pages 53-69. Gary L. Mullen, Henning Stichtenoth, and Horacio Tapia-Recillas, editors, Springer.
3. Daum, Magnus; Dobbertin, Hans; and Leander, Gregor (2003). An algorithm for checking normality of Boolean functions. In WCC03. 14 pages.
4. Dobbertin, Hans (1994). Construction of bent functions and balanced Boolean functions with high nonlinearity. In Fast Software Encryption-FSE 1994, volume 1008 of Lecture Notes in Computer Science, pages 61-74. Bart Preneel, editor, Springer.
5. Dubuc, Sylvie (2001). Etude des propriétés de dégénérescene et de normalité des fonctions booléennes et construction des fonctions q-aires parfaitement non-linéaires. PhD thesis, Université de Caen.
6. Kipnis, Aviad and Shamir, Adi (2004). New cryptographic primitives based on multiword Tfunctions. In Fast Software Encryption-FSE 2004. Bimal Roy and Willi Meier, editors. pre-proceedings, 14 pages.
7. Landau, David and Binder, Kurt (2000). A Guide to Monte Carlo Simulations in Statistical Physics. Cambridge University Press. ISBN 0-521-65314-2.
8. MacWilliams, F.J. and Sloane, N.J.A. (1991). The Theory of Error-Correcting Codes. Elsevier Science Publisher. ISBN 0-444-85193-3.
9. MAGMA. The MAGMA Computational Algebra System for Algebra, Number Theory and Geometry. Computational Algebra Group, University of Sydney. http://magma.maths.usyd.edu.au/magma/.
10. Rhoads, Glenn. Random number generator in C. http://remus.rutgers.edu/-rhoads/Code/rands.c.
11. Savage, Carla (1997). A survey of combinatorical Gray codes. SIAM Review, 39(4):605--629. http://www.csc.ncsu.edu/faculty/savage/AVAILABLE_FOR_MAILING/survey.ps.
12. WCC (2003). Workshop on Coding and Cryptography 2003. Daniel Augot, Pascal Charpin, and Grigory Kabatianski, editors, l'Ecole Suprieure et d'Application des Transmissions. ISBN 2-7261-1205-6.