The generalized XOR Lemma

Authors:
Yuliang Zheng;Xian-Mo Zhang
Affiliations:
Department of Software & Information Systems, The University of North Carolina at Charlotte, 9201 University City Blvd., Charlotte, NC;Department of Computing, Macquarie University, North Ryde, NSW 2109, Australia
Venue:
Theoretical Computer Science
Year:
2004

Citing 3
Cited 0

Privacy amplification by public discussion

SIAM Journal on Computing - Special issue on cryptography
Relating Differential Distribution Tables to Other Propertiesof of Substitution Boxes

Designs, Codes and Cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography

Quantified Score

Hi-index	5.23

Visualization

Abstract

The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of this paper is to extend the XOR Lemma to more general cases where a mapping may not be necessarily regular. The extended XOR Lemma has applications in the design of substitution boxes or S-boxes used in secret key ciphers. It also has applications in the design of stream ciphers as well as one-way hash functions. Of independent interest is a new concept introduced in this paper that relates the regularity of a mapping to subspaces.