Quantum-Resistant Electronic Digital Signature

Technology Overview

Researchers from a university in Russia have developed a revolutionary algorithm for a quantum-stable digital signature and public key based on results of fundamental research in mathematics. The researchers implemented the algorithm as a software prototype. The cryptographic stability of the digital signature guarantees information security when using it in e-economics, the Internet of Things (IoT) and other areas in the post-quantum era. The stability of the algorithm is ensured by solving the problem that has NP (non-polynomial intractable) complexity in the quantum sense. The university is looking for partners to commercialize the technology in international markets.

Technology Features & Specifications

Certified encryption standards are becoming hopelessly outdated. In 2010, a group of scientists from Japan, Europe, and the United States managed to successfully hack the data secured by a key built with commonly used RSA standard. The length of it was 768 bits. Since December 31, 2013, Mozilla browsers have ceased to support certificates of certification centers with RSA keys less than 2048 bits.

The development of quantum computers is bringing the post-quantum era closer, as was reported in a 2016 report by the National Institute of Standard and Technology. Therefore, there is an urgent need to develop and use new quantum-stable encryption standards. It is because all currently followed standards based on complexity of the problem of numbers factorization and discrete logarithm, may be broken by software based on the Shore algorithm.

A completely new algorithm for generating a digital signature based on the complexity of solving systems of polynomial equations in integers has been developed. It is based on results of the long-term fundamental research and on the expertise of software developers working in international IT companies. They developed digital signature based on algorithms with NP complexity in the quantum sense, also known as Quantum Merlin Arthur. These algorithms are resistant to hacking by quantum computers.

The university is looking for partners for technology transfer through a commercial agreement with technical assistance, a license agreement, an agreement on the provision of services and others.

Advantages and Innovation

The novelty of the proposed technology lies in developiong such algorithms which are of NP complexity in the quantum sense and which provide resistance to hacking them even if the attempts are made with the use of quantum computers. The algorithms also shows high-speed operation.

Potential Applications

Various security systems such as encryption/decryption, public key (PKI), key exchange, security protocols, certification verification (CA) can be implemented based on this specified mathematically sound scheme and technology. Methods of cryptographic protection of information are currently used in trading and banking systems, electronic document management, the Internet of Things, blockchain and many other areas. To obtain an undeniable advantage in the field of information security, it is necessary to implement the development of quantum-resistant cryptosystems within the next few years.

Market Trends and Opportunities

The size of digital signature market is expected to rapidly grow from USD 1.2 billion in 2018 to USD 5.5 billion by 2023 at a CAGR 36.7%. Main growth drivers will be increased demand for secure data exchange from e-commerce, e-banking and Internet of Things. It is expected that quantum-resistant algorithms would replace conventional ones from the majority of applications in the next 10 years.

Customer Benefits

The use of our novel implementation of this quantum-resistant electronic digital signature algorithm allows customers to obtain significant benefits in the following:

- It guarantees resistance to quantum attacks,

- It provides a high speed of document signing and signature verification, in particular, due to the speed of the algorithm, which is 315 times faster at the verification stage and 136 times at the signing stage, in comparison with the working time of the free RSA implementations.

Make an Enquiry