Cryptographic strength of a new symmetric block cipher based on Feistel network

Andriy Lagun

Abstrakt

The paper summarizes research on the cryptographic strength of a new symmetric block cipher based on the Feistel network. The classification of cryptographic attacks, depending on the cryptanalyst’s input data, is considered. For the purpose of testing, the linear and differential cryptanalysis as well as the Slide attack were used.

Słowa kluczowe: block cipher, the Feistel network, cryptographic strength
References

Sneier B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, 1996.

Feistel H., Cryptography and Computer Privacy, Scientific American, Vol. 228, No. 5, 1973.

Hoang V.T., Rogaway P., On Generalized Feistel Networks, Dept. of Computer Science, University of California, Davis, USA. 2010, 26.

Biham E., Shamir A., Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, 1991, 3-72.

Wagner D., The boomerang attack, U.S. Berkeley.

Chalermpong Worawannotai, Isabelle Stanton. A Tutorial on Slide Attacks.

Ciet M., Piret G., Quisquater J., Related-Key and Slide Attacks: Analysis, Connections, and Improvements, 002.

Blaze M., Diffie W., Rivest R.L., Schneier B., Shimomura T., Thompso E., Wiener M., Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security, 1996.

Stamp M., Low R.M., Applied Cryptanalysis: Breaking Ciphers in the Real World, Wiley-IEEE Press, 2007.

Instructions for using DIEHARD: a battery of tests of randomness, 1997.

www.csrc.nist.gov/groups/ST/toolkit/rng/stats_tests.html.