en/34.12-2015.texi

   1 @node en34122015
   2 @section Kuznechik (GOST R 34.12-2015)
   3
   4 @table @asis
   5 @item Algorithm type
   6     Block cipher
   7 @item Blocksize
   8     128 bit
   9 @item Keysize
  10     256 bit
  11 @item Structure
  12     Substitution-permutation network (SPN)
  13 @item Rounds
  14     10
  15 @item RFC
  16     @url{https://tools.ietf.org/html/rfc7801.html, 7801}
  17 @item Best attack
  18     Complexity 2@sup{140.3}, 2@sup{153.3} memory, 2@sup{113} data for 5 rounds
  19 @item Wikipedia
  20     @url{https://en.wikipedia.org/wiki/Kuznyechik, article}
  21 @end table
  22
  23 @strong{Features}:
  24 @itemize
  25 @item Feistel network is used during key schedule.
  26 @item Defined S-boxes was not created pseudorandomly, but with reverse
  27 engineered @url{https://eprint.iacr.org/2016/071.pdf, algorithm}.
  28 However there is no proof that it reduces cipher's strength.
  29 @end itemize
  30
  31 @strong{Implementations}: @ref{34122015Impl, here}.