Abstract
At Crypto’90, Koyama and Terada proposed a family of cryptographic functions for application to symmetric block ciphers. Youssef and Tavares showed that this family is affine and hence it is completely insecure. In response to this, Koyama and Terada modified their design, by including a data dependent operation between layers. The modified family of circuits was presented in the first international security workshop (ISW’97). In this paper, we show that the modified circuit can be easily broken by a differential-like attack. More explicitly, we show 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. The expected value of M ≪ 2d. Our attack enables us to explicitly recover these linear relations. We were able to break an 8—round 64—bit version of this family in few minutes on a workstation using less than 220 chosen plaintext-ciphertext pairs.
Chapter PDF
Similar content being viewed by others
References
Eli Biham and Adi Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, pp. 3–72, 1991.
K. Koyama and R. Terada, Nonlinear Parity Circuits and their cryptographic applications, Advances in Cryptology, Proceedings of Crypto’90, LNCS 537, pp. 582–599, Springer-Verlag, 1991.
K. Koyama and R. Terada, An Augmented Family of Cryptographic Parity Circuits, Proceeding of Information Security Workshop (ISW’97), LNCS1396, pp.198–208, Springer-Verlag, 1998.
T. Kaneko, K. Koyama and R. Terada, Dynamic swapping schemes and differential cryptanalysis IEICE Transactions on Fundamentals, vol. E77-A, pp. 1328–1336, 1994.
Y. Nakao, K. Koyama and R. Terada, The security of an RDES cryptosystem against linear cryptanalysis IEICE Transactions on Fundamentals, vol. E79-A, pp. 12–19, 1996.
M. Matsui, Linear Cryptanalysis method for DES cipher Advances in Cryptology, Proceedings of Eurocrypt’93, LNCS 765, pp. 386–397, Springer-Verlag, 1994.
A.M. Youssef and S.E. Tavares, Cryptanalysis of the “Non-linear parity circuits” proposed at crypto’90, IEE Electronics Letters, Vol.33, No. 7, pp. 585–586, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Youssef, A.M. (2001). Cryptanalysis of the “Augmented Family of Cryptographic Parity Circuits” Proposed at ISW’97. In: Stinson, D.R., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44983-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-44983-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42069-9
Online ISBN: 978-3-540-44983-6
eBook Packages: Springer Book Archive