Paper 2013/556

Algebraic Aspects of the Russian Hash Standard GOST R 34.11-2012

Oleksandr Kazymyrov and Valentyna Kazymyrova

Abstract

New GOST R 34.11-2012 standard has been recently selected by the Russian government to replace the old one. The algorithm is based on the hash function Stribog introduced in 2010. The high-level structure of the new hash function is similar to GOST R 34.11-94 with minor modifications. However, the compression function was changed significantly. Such a choice of the compression algorithm has been motivated by the Rjndael due to simplicity and understandable algebraic structure. In this paper we consider a number of algebraic aspects of the GOST R 34.11. We show how one can express the cipher in AES-like form over the finite field $\F_{2^8}$, and consider some approaches that can be used for the fast software implementation.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Minor revision. CTCrypt2013
Keywords
hash functionsone-way functions
Contact author(s)
okazymyrov @ gmail com
History
2013-09-04: received
Short URL
https://ia.cr/2013/556
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/556,
      author = {Oleksandr Kazymyrov and Valentyna Kazymyrova},
      title = {Algebraic Aspects of the Russian Hash Standard GOST R 34.11-2012},
      howpublished = {Cryptology ePrint Archive, Paper 2013/556},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/556}},
      url = {https://eprint.iacr.org/2013/556}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.