Технический комитет по стандартизации 
«Криптографическая защита информации» (TK 26)

скачать в PDF

Программа CTCrypt 2013

Monday, June 24


10-00 – 18-00Main program
10-00 Opening remarks
10-05 – 13-30 Analysis and design of cryptographic algorithms
10-05 – 10-30 Vladimir Antipkin. Smashing the MASH-1.
10-30 – 11-00 Ivan Chizhov, Mikhail Borodin. The failure of McEliece PKC based on Reed-Muller codes.
11-00 – 11-30 Grigory Marshalko. On the secutiry of a neural network-basedbiometric authentication scheme.
11-30 – 12-00 Coffee break
12-00 – 12-30 Gautham Sekar, Nicky Mouha, Bart Preneel. Meet-in-the-Middle Attacks on Reduced-Round GOST.
12-30 – 13-00 Andrey Dmukh, Denis Dygin, Grigory Marshalko. A lightweight-friendly modification of GOST block cipher.
13-00 – 13-30 Vladimir Popov, Stanislav Smyshlyaev. Construction of RNG using random automata and one-way functions.
13-30 – 15-00 Lunch
15-00 Mathematical problems of cryptology
15-00 – 15-20 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.
15-20 – 15-40 Alex Nesterenko. Constructing Endomorphisms Of Elliptic Curves.
15-40 – 16-00 Daniil Bylkov. Reconstruction of a linear recurrence of maximalperiod over a Galois ring of characteristic p3 by its highest digita lsequence.
16-00 – 16-20 Alexandr Abornev. Recursively-generated permutations of a binary space
16-20 – 16-40 Coffee break
16-40 – 17-00 Oleksandr Kazymyrov, Valentyna Kazymyrova, Roman Oliynykov.A Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent.
17-00 – 17-20 Stanislav Smyshlyaev. On the invariance of perfect balancedness property under the choice of tapping sequence.
17-20 – 17-40 Alexandr Serov. On the number of subfunctions of random boolean function which are close to the affine functions set.
17-40 – 18-00 Nikolay Kolomeec. On a property of quadratic Boolean functions.

Tuesday, June 25


10-00 – 11-35 Short message session
10-00 – 10-15 Sergey Agievich. Reducing the Discrete Logarithm Problem to the Diffie-Hellman Problem Using Auxiliary Problems.
10-15 – 10-30 Oleksandr Kazymyrov, Valentyna Kazymyrova. Algebraic Aspects of the Russian Hash Standard GOST R 34.11-2012.
10-30 – 10-45 Oleksandr Kazymyrov, Valentyna Kazymyrova. Extended Criterion for Absence of Fixed Points.
10-45 – 11-00 Nikolay Borisenko. Algorithm design software and hardware implementation of large size linear mapping.
11-00 – 11-15 Andrey Kostevich, Anton Shilkin. New technique for construction of universal tests for randomness.
11-15 – 11-35 Mikhail Goltvanitsa, Sergey Zaitsev. Description of maximal skew linear recurrences over fields in terms of multipiers and defining tuples of factors (Main program lecture).