CTCrypt 2016 - cryptography for every taste
In a week, from June 06 to June 08, the V International Symposium "Current Trends in Cryptography" (Current Trends in Cryptology - CTCrypt 2016 ) will take place in Yaroslavl. The symposium was organized by the Technical Committee for Standardization TC 26 "Cryptographic protection of information", the Academy of Cryptography of the Russian Federation and the Mathematical Institute. V.A. Steklov RAS.
The program of the symposium traditionally presents reports on the synthesis and analysis of domestic and foreign cryptographic algorithms and protocols, the study of their effective implementation, as well as the mathematical aspects of cryptography.
For the second year in a row, a section on quantum cryptography and quantum computing was presented at the symposium. This year, the section has a pronounced applied nature and is associated with specific developments of quantum key distribution systems. Representatives of the Russian Quantum Center will take part in the section as invited speakers.
The special theme of this year’s symposium is “The future of asymmetric cryptography”. At present, the possibility of creating a quantum computer and its threat to asymmetric cryptography is being actively discussed in the world, but classical mathematics is not in place either. A new approach to solving the discrete logarithm problem in a group of points of an elliptic curve over a finite field, proposed in 2004 by Igor Semaev, is based on the use of the so-called. summation polynomials, after the cycle of works by Diem , Petit and Quisquater and Semaev himself, first led to (hypothetically) a subexponential estimate of the complexity of discrete logarithmization for the case of a field of small characteristic. These results sparked heated debate in the international cryptographic community, dividing it into optimists and skeptics .
At the symposium, we decided to discuss what are the real prospects for the development of the approach proposed by Semaev, and how much it can affect the security of the actually used algorithms. To this end, we invited to participate in the discussion of specialists who have contributed most to the development or critical evaluation of this approach. These are Igor Semaev (Norway), who will give a review report, Klaus Diem (Germany), Christophe Petit (England) and Stephen Galbright (New Zealand).
In addition, at the symposium, traditionally, experts make presentations on the most relevant areas of cryptography. This year it is:
The program of the symposium traditionally presents reports on the synthesis and analysis of domestic and foreign cryptographic algorithms and protocols, the study of their effective implementation, as well as the mathematical aspects of cryptography.
For the second year in a row, a section on quantum cryptography and quantum computing was presented at the symposium. This year, the section has a pronounced applied nature and is associated with specific developments of quantum key distribution systems. Representatives of the Russian Quantum Center will take part in the section as invited speakers.
The special theme of this year’s symposium is “The future of asymmetric cryptography”. At present, the possibility of creating a quantum computer and its threat to asymmetric cryptography is being actively discussed in the world, but classical mathematics is not in place either. A new approach to solving the discrete logarithm problem in a group of points of an elliptic curve over a finite field, proposed in 2004 by Igor Semaev, is based on the use of the so-called. summation polynomials, after the cycle of works by Diem , Petit and Quisquater and Semaev himself, first led to (hypothetically) a subexponential estimate of the complexity of discrete logarithmization for the case of a field of small characteristic. These results sparked heated debate in the international cryptographic community, dividing it into optimists and skeptics .
At the symposium, we decided to discuss what are the real prospects for the development of the approach proposed by Semaev, and how much it can affect the security of the actually used algorithms. To this end, we invited to participate in the discussion of specialists who have contributed most to the development or critical evaluation of this approach. These are Igor Semaev (Norway), who will give a review report, Klaus Diem (Germany), Christophe Petit (England) and Stephen Galbright (New Zealand).
In addition, at the symposium, traditionally, experts make presentations on the most relevant areas of cryptography. This year it is:
- the author of the attacks on the hash functions MD5 and SHA Xiaoyun Wong (China), who will talk about the latest achievements in cryptanalysis of symmetric cryptographic algorithms;
- and the leading engineer of the European project SAFEcrypto Markku-Juhani Olavi Saarinen (UK), who will talk about the standardization of the so-called. post-quantum (not amenable to cryptanalysis using a quantum computer) algorithms.
')
Source: https://habr.com/ru/post/302072/
All Articles