Advanced

Further constructions of resilient Boolean functions with very high nonlinearity

Maitra, S and Pasalic, Enes LU (2002) In IEEE Transactions on Information Theory 48(7). p.1825-1834
Abstract
One well-known method of generating key stream sequences for stream ciphers is to combine the outputs of several linear-feedback shift registers (LFSR) using a combining Boolean function. Here we concentrate on the design of good combining Boolean functions. We provide resilient Boolean functions with currently best known nonlinearity. These functions were not known earlier and the issues related to their existence were posed as open questions in the literature. Some of the functions we construct here achieve the provable upper bound on nonlinearity for resilient Boolean functions. Our technique interlinks mathematical results with classical computer search.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
stream ciphers, resiliency, correlation immunity, nonlinearity, Boolean functions
in
IEEE Transactions on Information Theory
volume
48
issue
7
pages
1825 - 1834
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000176445200007
  • scopus:0036649611
ISSN
0018-9448
language
English
LU publication?
yes
id
f242f1c7-5e17-4ae9-925d-f99224dc8808 (old id 334543)
alternative location
http://ieeexplore.ieee.org.ludwig.lub.lu.se/iel5/18/21818/01013128.pdf?tp=&arnumber=1013128&isnumber=21818
date added to LUP
2007-11-16 16:04:36
date last changed
2017-10-22 04:44:59
@article{f242f1c7-5e17-4ae9-925d-f99224dc8808,
  abstract     = {One well-known method of generating key stream sequences for stream ciphers is to combine the outputs of several linear-feedback shift registers (LFSR) using a combining Boolean function. Here we concentrate on the design of good combining Boolean functions. We provide resilient Boolean functions with currently best known nonlinearity. These functions were not known earlier and the issues related to their existence were posed as open questions in the literature. Some of the functions we construct here achieve the provable upper bound on nonlinearity for resilient Boolean functions. Our technique interlinks mathematical results with classical computer search.},
  author       = {Maitra, S and Pasalic, Enes},
  issn         = {0018-9448},
  keyword      = {stream ciphers,resiliency,correlation immunity,nonlinearity,Boolean functions},
  language     = {eng},
  number       = {7},
  pages        = {1825--1834},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Transactions on Information Theory},
  title        = {Further constructions of resilient Boolean functions with very high nonlinearity},
  volume       = {48},
  year         = {2002},
}