skip to main content
10.1145/2947626.2947656acmotherconferencesArticle/Chapter ViewAbstractPublication PagessinConference Proceedingsconference-collections
short-paper

Modeling of Algebraic Analysis of GOST+ Cipher in SageMath

Published:20 July 2016Publication History

ABSTRACT

In this paper we present results of algebraic analysis of GOST⌖ algorithm in SageMath environment. Using the GOST⌖ as the example we explore basic stages of algebraic analysis of any symmetric block cipher based on Feistel network. We construct sets of boolean equations for five encryption rounds and determine the number of known text pairs for which the key can be found with the probability of 1. The algebraic analysis of five rounds of GOST⌖ allowed to find a 160-bit encryption key with the probability of 1 for five known text pairs within 797.21 s; the search for the solution took 24.66 s.

References

  1. Sage tutorial. http://www.sagemath.org/.Google ScholarGoogle Scholar
  2. M. Albrecht and C. Cid. Algebraic techniques in differential cryptanalysis. In Fast Software Encryption, pages 193--208. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Babenko, E. Ishchukova, and E. Maro. Research about strength of gost 28147-89 encryption algorithm. In Proceedings of the Fifth International Conference on Security of Information and Networks, pages 138--142. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. G. V. Bard, N. T. Courtois, and C. Jefferson. Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over gf (2) via sat-solvers. 2007.Google ScholarGoogle Scholar
  5. A. Biryukov and D. Wagner. Advanced slide attacks. In Advances in Cryptology -- EUROCRYPT 2000, pages 589--606. Springer, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Charnes, L. O'Connor, J. Pieprzyk, R. Safavi-Naini, and Y. Zheng. Comments on soviet encryption algorithm. In Advances in Cryptology -- EUROCRYPT'94, pages 433--438. Springer, 1994.Google ScholarGoogle Scholar
  7. N. T. Courtois and G. V. Bard. Algebraic cryptanalysis of the data encryption standard. In Cryptography and Coding, pages 152--169. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J.-C. Faugère and P.-J. Spaenlehauer. Algebraic cryptanalysis of the PKC'2009 algebraic surface cryptosystem. In Public Key Cryptography -- PKC 2010, pages 35--52. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Semenov, O. Zaikin, D. Bespalov, and M. Posypkin. Parallel Computing Technologies: 11th International Conference, PaCT 2011, Kazan, Russia, September 19-23, 2011. Proceedings, chapter Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System, pages 473--483. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Sepehrdad. Statistical and algebraic cryptanalysis of lightweight and ultra-lightweight symmetric primitives. PhD thesis, École Polytechnique Fédérale de Lausanne, 2012.Google ScholarGoogle Scholar
  11. M. Soos. CryptoMiniSAT, v2.5.1, 2010.Google ScholarGoogle Scholar
  12. Technical Committee for Standardization "Cryptography and Security Mechanisms" (TC 26). GOST R 34.12-2015 "Information technology. Cryptographic data security. Block ciphers.".Google ScholarGoogle Scholar
  13. M. Wang, Y. Sun, N. Mouha, and B. Preneel. Algebraic techniques in differential cryptanalysis revisited. In Information Security and Privacy, pages 120--141. Springer, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Modeling of Algebraic Analysis of GOST+ Cipher in SageMath

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          SIN '16: Proceedings of the 9th International Conference on Security of Information and Networks
          July 2016
          186 pages
          ISBN:9781450347648
          DOI:10.1145/2947626

          Copyright © 2016 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 20 July 2016

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • short-paper
          • Research
          • Refereed limited

          Acceptance Rates

          SIN '16 Paper Acceptance Rate12of46submissions,26%Overall Acceptance Rate102of289submissions,35%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader