Russia has developed a cryptographic mechanism that can withstand attacks by quantum computers

Teacher

Professional
Messages
2,669
Reaction score
819
Points
113
Cryptonite has developed a cryptographic mechanism that can withstand attacks by quantum computers. At the moment, the new mechanism is undergoing procedures for discussing and developing draft methodological recommendations for standardization. The software implementation itself is not yet available.

New cryptographic mechanism "Kodieum"

Employees of the Russian company "Kryptonite "(part of the "X Holding") have developed a cryptographic mechanism "Kodieum". According to the developers, Codieum will remain stable even after the appearance of a powerful quantum computer capable of cracking modern traffic encryption algorithms. It will protect the privacy of correspondence in instant messengers, bank transactions and any other data that is transmitted over the Internet and in other communication networks.

At the moment, the new mechanism is undergoing procedures for discussing and developing draft methodological recommendations for standardization. The software implementation itself is not yet available.

The Kodieum algorithm was presented on March 22 at RusCripto ' 24. A draft recommendation is currently being prepared. After that, it will be published in full detail for open discussion on the website of the technical committee for standardization of "cryptographic information security" (TC26).

The dangers of quantum computers

Quantum computers pose a threat to traditional cryptographic security systems because of their ability to perform operations on quantum bits (cubits), which can be both zero and one thanks to the principles of quantum mechanics.

Modern cryptographic systems use mathematical problems, the complexity of which protects information from hacking using classical computers. However, quantum computers can use the Shor algorithm (a special method that was developed for use on quantum computers and allows you to factorize a large number very quickly, which is usually done for quite a long time on conventional computers) to quickly factorize large prime numbers that are used in encryption algorithms such as RSA. This means that quantum computers can easily crack such security systems.

In addition, quantum computers can use the Grover algorithm (a quantum algorithm that helps a computer find the right information in a database faster than a normal computer) to efficiently search for a solution in unordered databases, which can also threaten cryptographic systems based on search algorithms.

When asked by CNews about the threat of quantum computers, the developers of Kodieum gave the following explanation:: "When a quantum computer appears, no act of secure communication will be possible without post-quantum mechanisms. Currently, data is transmitted over the Internet in encrypted form and can be collected by intermediate nodes in order to decrypt it later, after creating a quantum computer of sufficient performance. Therefore, we believe that we need to use post-quantum security algorithms right now. If we don't do this in the next 2-5 years, then it will be too late."

"It is not known when quantum computers will appear. But we know that the development and implementation of new cryptographic mechanisms takes not years, but decades! Therefore, they need to be developed today, and not in 2-5 years."

How Kodieum works

Codieum is based on a class of problems that will remain computationally complex even for quantum computers. CNews asked Kryptonite developers Ivan Chizhov and Victoria Vysotskaya to give an example of such a problem: "There are so-called NP-hard problems that, most likely, even a quantum computer will not be able to solve quickly. This is a special class of problems for which we do not yet know effective computational algorithms for solving. But if someone gives us a solution, we can quickly check its correctness. For example, imagine that we are going on a hike and we have a backpack for 100 liters. We want to take a certain set of items, each of which has its own volume. Question: can we choose items from this set in such a way as to fill the backpack completely, without voids? You don't need to take all the items away — you can only take part of them and give the other part to a friend. But it is important not to leave voids in the backpack and use your strength effectively.

It turns out that this problem is generally extremely difficult to solve for arbitrary volumes of backpacks and objects. Basically, you need to go through all the sets of items and calculate the total volume of these sets. Even for 50 items, you will need to sort through about 1,000,000 billion combinations (this is not a typo: exactly a million billion). What if there are 300 or 500 items? Then the numbers will be unimaginable for us. However, if I give you a set of items that the backpack fills, then you can easily check this by simply adding up their volumes. This is a classic example of an NP-hard problem.

Even a quantum computer will not be able to solve this problem of a backpack for a sufficient, large number of items. And if this backpack is not just numerical, but has a more intricate algebraic structure, then the quantum computer may give up altogether. The robustness and reliability of the Codium is based on such an "algebraic backpack" problem."

Technically, Codieum is a post-quantum analog of the widely used Diffie — Hellman protocol (a key exchange method that is used to ensure privacy in networks and encrypt data). Kodieum allows you to securely transfer the encryption key to create a secure connection.

Codieum is based on the mathematical problem of the complexity of decoding a random error-correcting code . Another post — quantum security algorithm, which was also developed in Kryptonite, is based on the same class of tasks-the Rosehip post-quantum electronic signature scheme.

• Source: https://kryptonite.ru/articles/codiaeum-russian-post-quantum-kem/
 
Top