Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
SIAM Journal on Discrete Mathematics
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Improved Construction of Nonlinear Resilient S-Boxes
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Designs, Codes and Cryptography
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Cryptographically resilient functions
IEEE Transactions on Information Theory
Bad and good ways of post-processing biased physical random numbers
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
| Hi-index | 754.84 |
A post-processing function is used to reduce or eliminate statistical weaknesses of physical random number generators. The output bias of a n-bit input m-bit output function is examined, when the input bits are biased. For this purpose, the definition of (n, m, t)-corrector is introduced; many characterizations and properties of a corrector are presented. It appears as a generalization of the notion of resilience for a vectorial function. Several constructions of correctors from old correctors are also proposed.