Partners

Supported by

Operator

Photo Gallery

2nd Workshop on Current Trends in Cryptology (CTCrypt 2013)

2nd Workshop on Current Trends in Cryptology (CTCrypt 2013), will be held on June 23-24, 2013 in Ekaterinburg, Russia.

CTCrypt 2013 is organized by Russian Technical Committee for Standardization TC 26 «Cryptography and security mechanisms», Academy of Cryptography of the Russian Federation, Steklov Mathematical Institute of RAS and the Ural Federal University, with the support of the InfoTeCS JSC.

Scope and Topics

Research papers on all technical aspects of cryptology are welcome. In particular, list of topics of interest includes (but is not limited to):

  • design and analysis of cryptographic algorithms; analysis of internationally standardized cryptographic algorithms;
  • efficient implementation of cryptanalytic techniques;
  • security evaluation of Russian cryptographic algorithms;
  • efficient implementation of Russian cryptographic algorithms.

Program Chairs

  • Vladimir Sachkov (Academy of Cryptography, Moscow, Russia)
  • Aleksei Kuz’min (TC 26, Moscow, Russia)

Program Committee

  • Dmitry Ananichev (Ural Federal University, Ekaterinburg, Russia )
  • Mikhail Glukhov (Academy of Cryptography, Moscow, Russia)
  • Igor Kachalin (TC 26, Moscow, Russia)
  • Anatoly Lunin (TC 26, Moscow, Russia)
  • Dmitry Matyukhin (TC 26, Moscow, Russia)
  • Aleksandr Nechaev (Lomonosov Moscow State University, Moscow, Russia)
  • Yury Nesterenko (Lomonosov Moscow State University, Moscow, Russia)
  • Andrei Pichkur (Educational and Methodical Association of Higher Educational Institutions of Russia on Education in Information Security, Moscow, Russia)
  • Eduard Primenko (Lomonosov Moscow State University, Moscow, Russia)
  • Aleksandr Shoitov (Moscow State Institute of Radio-Engineering, Electronics and Automation (Technical University), Moscow, Russia)
  • Andrei Zubkov (Steklov Mathematical Institute of RAS, Moscow, Russia)

Important dates

Deadline for the paper submission: March 25, 2013

Notification: April 22, 2013

Official languages: English and Russian

Paper language: English

Electronic presentation language: English

Submission and Publication

Program Committee invites submissions in the form of papers (up to 10 pages according to LaTeX options given below) in English. Proofs and other material omitted due to the space constraints should be put into a separate appendix dedicated for the referees. Submissions (in LaTeХ and PDF formats) should be sent as attachments by e-mail with subject line “CTCrypt 2013” to Anatoly Lunin (tc26@infotecs.ru). The acknowledgment will be send during 3 days.

Program committee plans to have regular sessions and posters presentations. Short abstracts of accepted papers will be published at CTCrypt 2013 web page before the workshop. Pre-proceedings of the workshop will be published in form of CD and given to the participants at the registration desk.

Program committee plans to publish the final versions of selected papers in the post-proceedings of the workshop.

The talk at the workshop is a necessary condition for the publication in post-proceedings.

 

CTCrypt 2013 Preliminary program

Monday, June 24

 

10-00 – 18-00 Main 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).