Effectiveness evaluation of spn-structure of symmetrick block cipher

Authors

DOI:

https://doi.org/10.15587/1729-4061.2014.30988

Keywords:

high-level construct, SPN-structure, block cipher, algorithm- distinguisher, random permutation

Abstract

SPN-structure, along with a Feistel network and a Lai-Massey scheme is one of the most common high-level constructs for building symmetric block ciphers. At the same time, not so many papers are devoted to the evaluation of its effectiveness, so research in this area are extremely important.

The evaluation method, based on the possibility of distinguishing the SPN-structure from a random permutation is considered in the paper. This method was successfully applied to the Feistel network and the Lai-Massey scheme, so it was expedient to apply it to the SPN-structure as well. To solve this problem, the authors have put forward and proved a theorem on the maximum likelihood of distinguishing the SPN-structure from a random permutation. Algorithm-distinguisher that allows to make a distinction with a certain probability was developed for the 2-round structure. Also, it was proved that it is impossible to make a distinction for 3 or more rounds of the SPN-structure.

The results can be used to compare the effectiveness of the SPN-structure with other high-level constructs of symmetric block ciphers

Author Biographies

Дмитрий Сергеевич Кайдалов, Kharkiv National University of Radioelectronics Lenina 14 ave., Kharkiv, Ukraine, 61166

Graduate student

The department of security of information technologies

Роман Васильевич Олейников, Kharkiv National University of Radioelectronics Lenina 14 ave., Kharkiv, Ukraine, 61166

Professor, Doctor of technical sciences

The department of security of information technologies

References

  1. Vaudenay, S. (2003). Decorrelation: a theory for block cipher security. Journal of Cryptology, 16 (4), 249–286. doi: 10.1007/s00145-003-0220-6
  2. Luby, M., Rackoff, С. (1988). How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17 (2), 373–386. doi: 10.1137/0217022
  3. Maurer, U. M. (1993). A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators. Advances in Cryptology – EUROCRYPT'92 : рroceedings of the Workshop on the Theory and Application of of Cryptographic Techniques, 239–255.
  4. Oliynykov, R. V., Kaidalov, D. S. (2011). Clarification in distinguishing effectiveness of Feistel scheme and random permutation. Radiotechnik, Ukraininan journal, 167, 190–202.
  5. Oliynykov, R. V., Kaidalov, D. S. (2012). Complexity estimation of distinguishing Ley-Massey sheme and random permutation. Applied radioelectronics, 11 (2), 152–159.
  6. Patarin, J. (2001). Generic attacks on Feistel schemes. Advances in Cryptology – ASIACRYPT 2001 : рroceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia. Berlin ; Heidelberg : Springer, 222–238.
  7. Patarin, J. (2004). Security of random Feistel schemes with 5 or more rounds. Advances in Cryptology – CRYPTO 2004 : рroceedings of the 24th Annual International CryptologyConference, Santa Barbara, California, USA. Berlin ; Heidelberg : Springer, 106–122.
  8. Patarin, J. (1998). About Feistel schemes with six (or more) rounds. Lecture Notes in Computer Science, 103–121. doi: 10.1007/3-540-69710-1_8
  9. Vaudenay, S. (1999). On the Lai-Massey Scheme. Lecture Notes in Computer Science, 8–19. doi: 10.1007/978-3-540-48000-6_2
  10. Shannon, C. E. (1963). Communication theory of secret systems. Moscow, 333–369.
  11. Gilbert, Н., Peyrin, T. (2009). Super-Sbox Cryptanalysis: Improved Attacks for AES-like permutations. Cryptology ePrint Archive. Available at: https://eprint.iacr.org/2009/531.pdf

Downloads

Published

2014-12-23

How to Cite

Кайдалов, Д. С., & Олейников, Р. В. (2014). Effectiveness evaluation of spn-structure of symmetrick block cipher. Eastern-European Journal of Enterprise Technologies, 6(9(72), 4–10. https://doi.org/10.15587/1729-4061.2014.30988

Issue

Vol. 6 No. 9(72) (2014): Information and controlling system

Section

Information and controlling system

License

Copyright (c) 2014 Дмитрий Сергеевич Кайдалов, Роман Васильевич Олейников

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.