International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Almost Security of Cryptographic Boolean Functions

Authors:
Kaoru Kurosawa
Download:
URL: http://eprint.iacr.org/2003/075
Search ePrint
Search Google
Abstract: $PC(l)$ of order $k$ is one of the most general cryptographic criteria of secure Boolean functions. In this paper, we introduce its $\epsilon$-almost version. The new definition requires {\it only} that $f(X)+f(X+\Delta)$ is {\it almost} uniformly distiributed (while the original definition of $PC(l)$ of order $k$ requires that it is {\it strictly} uniformly distiributed). We next show its construciton. Better parameters are then obtained than normal $PC(l)$ of order $k$ functions.
BibTeX
@misc{eprint-2003-11791,
  title={Almost Security of Cryptographic Boolean Functions},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / boolean functions},
  url={http://eprint.iacr.org/2003/075},
  note={ kurosawa@cis.ibaraki.ac.jp 12166 received 23 Apr 2003},
  author={Kaoru Kurosawa},
  year=2003
}