[Resource Topic] 2003/075: Almost Security of Cryptographic Boolean Functions

Welcome to the resource topic for 2003/075

Almost Security of Cryptographic Boolean Functions

Authors: Kaoru Kurosawa


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
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.

ePrint: https://eprint.iacr.org/2003/075

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .