Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Construction of cryptographically important Boolean functions

Publiceringsår: 2002
Språk: Engelska
Sidor: 234-245
Publikation/Tidskrift/Serie: Progress in Cryptology / Lecture Notes in Computer Science
Volym: 2551
Dokumenttyp: Konferensbidrag
Förlag: Springer Berlin / Heidelberg


Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean function is said to be correlation immune if its output leaks no information about its input values. Balanced correlation immune functions are called resilient functions. Finding methods for easy construction of resilient functions with additional properties is an active research area. Maitra and Pasalic [3] have constructed 8-variable 1-resilient Boolean functions with nonlinearity 116. Their technique interlinks mathematical results with classical computer search. In this paper we describe a new technique to construct 8-variable 1-resilient Boolean functions with the same nonlinearity. Using a similar technique, we directly construct 10-variable (resp. 12-variable), 1-resilient functions with nonlinearity 488 (resp. 1996). Finally, we describe some results on the construction of n-variable t-resilient functions with maximum nonlinearity.



  • Electrical Engineering, Electronic Engineering, Information Engineering
  • function
  • stream cipher
  • combinatorial problems
  • resiliency
  • correlation immunity
  • algebraic degree
  • Boolean function
  • balancedness
  • bent function
  • nonlinearity
  • perfectly nonlinear


INDOCRYPT 2002: Third International Conference on Cryptology
India Hyderabad, India
  • ISSN: 0302-9743

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen