Technical committee for standardization 
«Cryptography and security mechanisms» (TC 26)


This site is outdated and does not update since 01/01/2018

update website

Accepted Papers CTCrypt`2013

  1. Alexandr Abornev. Recursively-generated permutations of a binary space  (Publication**)
  2. Vladimir Antipkin. Smashing the MASH-1  (Publication*)   (Publication**)
  3.  Daniil Bylkov. Reconstruction of a linear recurrence of maximal period over a Galois ring of characteristic p^3 by its highest digital sequence   (Publication**)
  4. Ivan Chizhov, Mikhail Borodin. The failure of McEliece PKC based on Reed-Muller codes (Publication*)
  5. Andrey Dmukh, Denis Dygin, Grigory Marshalko. A lightweight-friendly modification of GOST block cipher  (Publication**)
  6. Mikhail Goltvanitsa, Sergey Zaitsev. Description of maximal skew linear recurrences over fields in terms of multipiers and defining tuples of factors   (Publication**)  (Publication**)
  7. Oleksandr Kazymyrov, Valentyna Kazymyrova, Roman Oliynykov. A Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent  (Publication*)  (Publication**)
  8. Nikolay Kolomeec. On a property of quadratic Boolean functions  (Publication**)
  9. Grigory Marshalko. On the secutiry of a neural network-based biometric authentication scheme  (Publication**)
  10. Alex Nesterenko. Constructions of elliptic curves endomorphisms  (Publication**)
  11. Dmitry Pilshchikov. Estimation of time-memory-data tradeoff methods’ characteristics using limits of generating function of the particle number and total number of particles in the Galton-Watson process  (Publication**)
  12. Vladimir Popov, Stanislav Smyshlyaev. Construction of RNG using random automata and one-way functions  (Publication**)
  13. Gautham Sekar, Nicky Mouha, Bart Preneel. Meet-in-the-Middle Attacks on Reduced-Round GOST  (Publication**)
  14. Alexandr Serov. On the number of subfunctions of random boolean function which are close to the affine functions set 
  15. Stanislav Smyshlyaev. On the invariance of perfect balancedness property under the choice of tapping sequence  (Publication**)

    Short message session CTCrypt’2013

    1. Sergey Agievich. Reducing the Discrete Logarithm Problem to the Diffie-Hellman Problem Using Auxiliary Problems (Publication***)
    2. Nikolay Borisenko. Algorithm design software and hardware implementation of large size linear mapping
    3. Oleksandr Kazymyrov, Valentyna Kazymyrova. Algebraic Aspects of the Russian Hash Standard GOST R 34.11-2012 (Publication*)
    4. Oleksandr Kazymyrov, Valentyna Kazymyrova. Extended Criterion for Absence of Fixed Points (Publication*)
    5. Andrey Kostevich, Anton Shilkin. New technique for construction of universal tests for randomness (Publication***)

    (Publication*)   - publication in Cryptology ePrint Archive
    (Publication**) - publication in "Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]", 2014, Volume 5, Issue 2

    Program Committee CTCrypt'2013