Cryptographically resilient functions

This correspondence studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution, and random sequence generation for stream ciphers. We present a number of new methods for synthesizing resilient functions. An interesting aspect o...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1997-09, Vol.43 (5), p.1740-1747
Main Authors: Zhang, Xian-Mo, Zheng, Yuliang
Format: Article
Language:English
Subjects:
Australia Council
Computer science
Cryptography
Data security
Distributed computing
Fault tolerance
Filtering
Functions
Information processing
Information technology
Mathematical models
Quantum computing
Random sequences
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This correspondence studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution, and random sequence generation for stream ciphers. We present a number of new methods for synthesizing resilient functions. An interesting aspect of these methods is that they are applicable both to linear and nonlinear resilient functions. Our second major contribution is to show that every linear resilient function can be transformed into a large number of nonlinear resilient functions with the same parameters. As a result, we obtain resilient functions that are highly nonlinear and have a high algebraic degree.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.623184