HomeIssuesBounds for the number of rounds with impossible differences in generalized Feistel schemes

Bounds for the number of rounds with impossible differences in generalized Feistel schemes | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2015. № 1 (27).

The class of ciphers described by a generalized Feistel scheme is considered. Some upper and lower bounds for the maximum number of rounds with impossible differences are provided. They do not depend on the type of Feistel scheme and on the number of nonlinear functions or blocks in the register.
Download file
Counter downloads: 67
  • Title Bounds for the number of rounds with impossible differences in generalized Feistel schemes
  • Headline Bounds for the number of rounds with impossible differences in generalized Feistel schemes
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 1 (27)
  • Date:
  • DOI
Keywords
differential probability, generalized Feistel scheme, impossible differential, block cipher, число Фробениуса, невозможная разность, обобщённый алгоритм шифрования Фейстеля
Authors
References
Sylvester J. J. Problem 7382 // Math. Quest. From Educat. Times. 1884. V.37. P. 26.
Kim J., Hong S., and Lim J. Impossible differential cryptanalysis using matrix method // Discr. Math. 2010. V.310. P. 988-1002.
Luo Y., Wu Z., Lai X., and Gong G. A unified method for finding impossible differentials of block cipher structures // Inform. Sci. 2014. V.263. P. 211-220.
Feistel H., Notz W., and Smith J. L. Some cryptographic techniques for machine-to-machine data communications // Proc. IEEE. 1975. V. 63. No. 11. P. 1545-1554.
Schnorr C. P. On the construction of random number generators and random function generators // EUROCRYPT'88. LNCS. 1988. V.330. P. 225-232.
Li R., Sun B., Li C., and Qu L. Cryptanalysis of a generalized unbalanced Feistel network structure // ACISP'2010. LNCS. 2010. V.6168. P. 1-18.
Zheng Y., Matsumoto T., and Imai H. On the construction of block ciphers provably secure and not relying on any unproved hypotheses // CRYPTO'1989. LNCS. 1989. V.435. P. 461-480.
Knudsen L.R. DEAL - a 128-bit block cipher. Technical report 151. Department of Informatics, University of Bergen, Norway, February 1998.
Biham E., Biryukov A., and Shamir A. Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials // EUROCRYPT'99. LNCS. 1999. V. 1592. P. 12-23.
Bogdanov A. and Shibutani K. Generalized Feistel networks revisited // Designs, Codes and Cryptography. 2012. V. 66. P. 75-79.
Suzaki T. and Minematsu K. Improving the generalized Feistel // FSE'2010. LNCS. 2010. V. 6147. P. 19-39.
Lai X., Massey J. L., and Murphy S. Markov ciphers and differential cryptanalysis // EuroCrypt'91. LNCS. 1991. V. 547. P. 17-38.
Nyberg K. Generlized Feistel networks // ASIACRYPT'1996. LNCS. 1996. V. 1163. P. 91-104.
Schneier B. and Kelsey J. Unbalanced Feistel networks and block cipher design // FSE'2005. LNCS. 2005. V. 3557. P. 121-144.
Zhang L., Wu W., and Zhang L. Proposition of two cipher structures // Inscrypt'2009. LNCS. 2010. V. 6151. P. 215-229.
Shibutani K., Isobe T., Hiwatari H., et al. Piccolo: an ultra-lightweight blockcipher // CHES'2011. LNCS. 2011. V.6917. P. 342-357.
Bounds for the number of rounds with impossible differences in generalized Feistel schemes | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2015. № 1 (27).
Bounds for the number of rounds with impossible differences in generalized Feistel schemes | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2015. № 1 (27).
Download full-text version
Counter downloads: 256