Nonlinear Parity Circuits and their Cryptographic Applications
Kenji Koyama,Routo Terada +1 more
- pp 582-600
TLDR
These parity circuits are proven to satisfy some of the properties required in cryptography; involution, nonlinearity, the probability of bit complementation, avalanche effect, equivalent keys and computational efficiency.Abstract:
This paper proposes a new family of nonlinear cryptographic functions called parity circuits. These parity circuits compute a one-to-one Boolean function, and they can be applied to symmetric block ciphers. In this paper, parity circuits are first defined. Next, these circuits are proven to satisfy some of the properties required in cryptography; involution, nonlinearity, the probability of bit complementation, avalanche effect, equivalent keys and computational efficiency. Finally, the speed of parity circuits implemented using the current hardware technology is estimated to show they can achieve 160 Mbps with a 64-bit block size, 8 rounds, and 3.2 K gates.read more
Citations
More filters
Journal Article
An augmented family of cryptographic Parity Circuits
Kenji Koyama,Routo Terada +1 more
TL;DR: In this paper, a computationally inexpensive involution called value dependent swapping is introduced to increase the non-affineness of Parity Circuits and thus increase its strength against cryptanalysis.
Book ChapterDOI
Cryptanalysis of the ``Augmented Family of Cryptographic Parity Circuits'' Proposed at ISW'97
TL;DR: This paper shows that after d rounds, and for any specific key K, the input space can be partitioned into M ≤ 2d sets such that the ciphertext Y of each set is related to the plaintext X by an affine relation, and enables us to explicitly recover these linear relations.
Book ChapterDOI
An Augmented Family of Cryptographic Parity Circuits
Kenji Koyama,Routo Terada +1 more
TL;DR: The value-dependent swapping can be incorporated into DES-like cryptographic functions as well to make them stronger against cryptanalysis and formulate affineness for a general function, and introduce a normalized non-affineness measure.
References
More filters
Journal Article
Data encryption standard
TL;DR: Presentation de la norme americaine de codage des donnees informatisees (DES: Data Encryption Standard) permet de proteger lesDonnees selon des criteres qui sont developpes dans ce texte.
Book
Analysis And Design Of Stream Ciphers
TL;DR: A comparison of the Knapsack as a Nonlinear Function and Nonlinear Combining Functions with Memory, and the Summation Principle, which helps clarify the role of memory in the generation of sequences.
Book ChapterDOI
Nonlinearity criteria for cryptographic functions
Willi Meier,Othmar Staffelbach +1 more
TL;DR: Nonlinearity criteria for Boolean functions are classified in view of their suitability for cryptographic design and two criteria turn out to be of special interest, the distance to linear structures and the Distance to affine functions, which are shown to be invariant under all affine transformations.
Journal ArticleDOI
An introduction to contemporary cryptology
TL;DR: An appraisal is given of the current status of cryptologic research and the principal concepts of both secret-key and public-key cryptography are described.