Supported by

Operator

Photo Gallery

Accepted papers

  1. Asymptotic local inversion of some random finite-state machine with a growing number of internal states
    Vladimir Vinokurov

  2. Sequential unforgeability of ElGamal blind signatures
    Alexandra Babueva, Ilya Makhonin, Stanislav Smyshlyaev and Mariia Utekhina

  3. Full Cryptanalysis of the pqsigRM Signature Scheme
    Andrei Rubenkov

  4. Two-level multilinear hash – efficient precomputations in exchange for one bit of security
    Vitaly Kiryukhin

  5. On metric complements of some subclasses of bent functions
    Nikolay Kolomeec and Natalia Tokareva

  6. On the security of belt-hash and belt-compress
    Sergey Agievich

  7. On cryptographic properties and efficient implementation of MDS-matrices with nontrivial automorphism groups
    Dmitry Burov, and Sergey Kostarev

  8. Functions over finite fields constructed using polynomials over Galois rings and the trace function
    Oleg Kamlovskii

  9. Probabilistic Analysis of Linear Approximation Correlation for Unbalanced Feistel Networks with Modular Reduction
    Alexander Kargin and Denis Fomin

  10. Inseparability of Internal Rekeying and Encryption Mode Analysis
    Aleksandr Bakharev, Kirill Tsaregorodtsev

  11. On the practical secrecy of keys formed by the emission scheme of the recovery process
    Dmitriy Bogdanov

  12. A new family of block ciphers "Ramen-K"
    Andrei Dmukh, Dmitry Pasko and Danil Peshkov

  13. On the Invariant Subspaces of Finite Field Hadamard Matrices
    Stepan Davydov and Sergey Kostarev

  14. Joint security of VKO mechanism and GOST signature scheme in elliptic curve generic group model
    Aleksandr Bakharev, Aleksey Drynkin, Kirill Tsaregorodtsev

  15. The PRAPOR-K Russian Family of Lightweight Block Ciphers
    Andrei Dmukh and Dmitry Trifonov

  16. On the limits of integral attacks on block cryptographic algorithms
    Anastasiia Chichaeva and Vasily Shishkin

  17. On the UKS threat and the impact of the ability to obtain and force future ephemeral keys of honest parties on its feasibility
    Evgeny Alekseev, Alena Mukhortova, Stanislav Smyshlyaev, Sergey Kyazhin

  18. Preimages for belt-compress and belt-hash
    Vitaly Kiryukhin

  19. On the boomerang uniformity of piecewise-monomial substitutions over the field F2n
    Yuriy Kalinin, Aleksandr Kutsenko, Andrey Menyachikhin

  20. Invariant Subspace Attack on the GOST 28147-89 Block Cipher
    Stepan Davydov

  21. On some approaches to statistical testing of cryptographic generators of random and pseudorandom sequences (Invited Talk)
    Yuriy Kharin, Vladimir Palukha

  22. Lower bound for the Shannon entropy for one probability-theoretic model of a cryptographic key source
    Vladimir Mironkin

  23. A Shannon-inspired definition of blindness
    Liliya Akhmetzyanova, Stanislav Smyshlyaev and Mariia Utekhina

  24. On the search for cyclic permutations using heuristic methods and digraph representation
    Alejandro Freyre Echevarrı́a, Ramses Rodrı́guez Aulet and Adrián Alfonso Peñate

  25. Features of the cipher Belt
    Fedor Malyshev

  26. Cryptanalysis of the McEliece cryptosystem based on elliptic codes: a review of known methods and a new structural attack with hints
    Artyom Kuninets, Ekaterina Malygina and Evgeniy Melnichuk

  27. Properties of codes defined by quadratic relations and applications to linear code decoding
    Ivan Chizhov

  28. Security analysis of post-quantum hash-based signatures on the composition of random mappings
    Alexey Zelenetsky and Oleg Turchenko

  29. On parity decision trees basic parameters and harmonic properties of Boolean functions connection
    Elena Kutyreva and Oleg Logachev

  30. Hybrid and Fully Bitsliced: Two Approaches to Implementing MGM
    Anatoly Solovyev

  31. Exact formulas for expectations of number of pairs of coinciding s-chains in urn schemes with and without replacements for two types of balls
    Vasiliy Kruglov