Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

InTech eBooks

Quantum Encrypted Data Transfers in GRID

Mihai Octavian Dima, Mihnea Dulea, A. Dima, Mario-Alexandru Stoica, M. Udre

Published Feb 28, 2011• 0 citations
Publisher

Abstract

GRID computing includes applications, some of which are intelligence sensitive (genetics, space, industrial intellectual property, etc) and need to remain confidential. Current security is mostly based based on public (asymmetric) key algorithms (Salomaa, 1996) – hash function algorithms easy to calculate in direct, but estimated as impossible in reverse. The base assumption to this assertion is the difficulty of factorising prime numbers. This received however a serious blow in 1994 (Shor, 1994), when it was shown that (a hypothetical future) quantum computer could rapidly factorise prime numbers via a polynomial algorithm. As such messages could be intercepted and stored today awaiting for the availability of quantum processors, when they could conceivably be deciphered. Evidently, data with short “life-span” (2-5 years) is perfectly safe today, however censi, geological data, etc have long-term implications and need to be adequately protected. The other main security contender currently in use is the symmetric-key AES encryption (Daemen and Rijmen, 1996-2001 and 2006), that comes in 3 versions of key length 128, 192 and 256 bit (with 10, 12, and 14 rounds, respectively). For AES-128 there is no known attack faster than the 2128 complexity of exhaustive search. However, AES-192 and AES-256 were recently shown (Biryukov and Khovratovich, 2009) to be breakable by attacks of 2176 and 2119 complexities. While these are much faster than the exhaustive search, they are non-practical, and do not to pose a real threat (at the rate the world produces today data, ca. 0.2⋅1021 bytes/year (261 × 256-bit ciphertexts) it would take 258 ≅ 1017 years data’s worth to recover just one AES key). The US National Security Agency (Hathaway, 2003) stated that “The design and strength of all key lengths of the AES algorithm (i.e., 128, 192 and 256) are sufficient to protect classified information up to the secret level.” From this assessment and the simple estimates above, it is apparent that given adequate key distribution protection AES cannot be broken – at least not in the next 1017 years (for 1 key). The secret key carrier on the other hand needs to be a stable long-term committed technology, that would not come under question any time soon (including from futuristic quantum processor attacks).

DOI
10.5772/14365

Related papers

Post–Quantum Cryptography – A Primer

P. V. Ananda Mohana

Traditionally, information security needed encryption, authentication, key management, non-repudiation and authorization which were being met using several techniques. Standardization of algorithms by National Institute of Standards and Technology (NIST) has facilitated international communication for banking and information transfer using these standards. Encryption can be carried out using Advanced Encryption Standard (AES) using variable block lengths (128, 192 or 256 bits) and variable key lengths (128, 192 or 256 bits). Solutions for light weight applications such as those for Internet of Things (IoT) are also being standardized. Message integrity is possible using host of hash algorithms such as SHA-1, SHA-2 etc., and more recently using SHA-3 algorithm. Authentication is possible using well known Rivest-Shamir-Adleman (RSA) algorithm needing 2048/4096 bit operations. Elliptic Curve Cryptography (ECC) is also quite popular and used in several practical systems such as WhatsApp, Blackberry etc. Key exchange is possible using Diffie-Hellman algorithm and its variations. Digital Signatures can be carried out using RSA algorithm or Elliptic Curve Digital Signature Algorithm (ECDSA) or DSA (Digital Signature Algorithm). All these algorithms derive security from difficulty in solving some mathematical problems such as factorization problem or discrete logarithm problem. Though published literature gives evidence of solving factorization problem upto 768 bits only, it is believed that using Quantum computers, these problems could be solved by the end of this decade. This is due to availability of the pioneering work of Shor and Grover [1]. For factoring an integer of N bits, Shor’s algorithm takes quantum gates. As such, there is ever growing interest in being ready for the next decade with algorithms that may resist attacks in the quantum computer era. NIST has foreseen this need and has invited proposals from researchers all over the world. In the first round, about 66 submissions were received which have been scrutinized for completeness of submissions , novelty of the approach and security and 25 of these were promote to second round to improve based on the comments received on the first round submission. These will be analyzed for security and some will be selected for final recommendation for use by industry. These are for encryption/decryption, key agreement, hashing and Digital Signatures for both hardware and software implementations. In this paper, we present a brief survey of the state of the art in post-Quantum Cryptography (PQC) followed by study of one of technique referred to as Learning With Errors (LWE) in some detail.

•Mar 31, 2020•0 citations

Quantum-Safe Cryptography

Kunal Meher

The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.

Chapman & Hall/CRC eBooks•Aug 9, 2023•3 citations

Lattice-based PKEs/KEMs

Xianhui Lu, Jiang Zhang

The invention of public-key cryptography (PKC) by Diffie and Hellman in 1976 is one of two milestones marking the beginning of modern cryptography. The security of a PKC system requires that it should be infeasible to compute the private key from a given public key, which in turn is typically guaranteed by the difficulty in solving some cryptographic-friendly mathematical problems. Among those problems, the integer factorization and discrete logarithm problems play pivotal roles in the development of public-key cryptography. In particular, the assumption that there is no polynomial time (classical) algorithm that solves the above two problems constitutes the basis for the security of almost all currently used public-key cryptosystems, such as RSA and ElGamal. However, Shor [1] found an efficient quantum solving algorithm for the integer factorization and discrete logarithm problems in 1994, which would destroy the security basis for most real deployed PKC systems if large-scale quantum computers become available. The rapid development of quantum technology in recent years suggests that we are getting closer to the quantum crisis of current PKC systems. As a response to the quantum crisis, the research community has made many efforts to post-quantum cryptography (PQC) that are believed to resist quantum computer attacks. Lattice-based cryptography is one of the main directions in this area, and has become the most promising PQC candidate for standardization. The research of lattice-based cryptography dates back to the seminal work of Ajtai [2], which first based the security of cryptographic primitives on the difficulty of solving some lattice problems such as the approximate shortest vector problem and the closest vector problem. After more than two decades of development, lattice-based cryptography has gained substantial progress. In theory, we have witnessed the construction of many powerful cryptographic primitives that were not known before. In practice, the public key size of lattice-based cryptosystems has been significantly reduced from several gigabytes to a few kilobytes. For current applications and standardization, key exchanges, public-key encryptions (PKEs) and signatures are the most desired lattice-based cryptosystems, where the first two are often used to ensure information secrecy, while the last provides information authentication. Note that public-key encryptions are equivalent to two-round key exchanges, also known as the key encapsulation mechanism (KEM). In the following, we focus on lattice-based PKEs/KEMs. The design principle of lattice-based PKEs/KEMs follows two approaches: a trapdoor one-way function and an approximate commutative one-way function. In the first approach, a trapdoor one-way function f and its trapdoor f−1 are generated as the public key and private key. A plaintext m is encrypted as c = f(m), and the ciphertext is decrypted as m = f−1(c). The NTRU scheme and its variants follow such an approach. In the second approach, an approximate commutative function fs and a random input a are generated, the public key is (a, b = fs(a)) and the private key is s. A plaintext m is encrypted as c1 = gr(a), c2 = gr(b) + E(m), where r is a random element, g is an approximate commutative one-way function and E is the encoding of an error-correction code. The ciphertext (c1, c2) is decrypted as m = D(c2 − fs(c1)), where D is the decoding of an error-correction code. The correctness of decryption is guaranteed by the approximate commutative property (gr(b) = gr(fs(a)) ≈ fs(gr(a)) = fs(c1)) and the error-correction code. Learning with errors (LWE) problem-based PKE/KEM schemes and their variants follow such an approach. The standardization of PQC has received substantial support from national funding agencies, such as the European Union projects PQCrypto and SAFEcrypto. The USA National Institute of Standard and Technology (NIST) started the post-quantum standardization project in 2012, organized a worldwide ‘competition’ in 2016 and plans to deliver draft standards before 2024. After two rounds of evaluation, seven schemes were accepted as the round-three candidates on 22 July 2020, of which five are lattice-based schemes. In 2017, the International organization for standardization started a study project of post-quantum cryptography named SD8. Most LWE-based PKE schemes such as Kyber and LAC follow the Lindner-Peikert framework [3] up to the choices of ring structure, noise distribution and parameters. As the size of noise in lattice-based PKEs/EKMs is typically larger than the lower bits of the ciphertext, many schemes often artificially drop a few lower bits to optimize the practical performance without significantly increasing the final decryption noise. Kyber [4] is one of the most promising PKE/KEM candidates in the NIST PQC standardization, whose security is provably based on the difficulty of so-called module LWE (MLWE) problems. The use of MLWE allowed Kyber to obtain additional flexibility and security advantages, while keeping the same efficiency as those based on the ring-LWE problems. The strategy of dropping some lower bits is used to compress both the public-key and ciphertext sizes. For a targeted 128-bit quantum security, the public-key and ciphertext sizes of Kyber is around a single kilobyte. LAC [5] uses several techniques to reduce the modulus as small as possible: it uses a byte-level modulus, embeds powerful error-correcting codes to maximize the noise-modulus rate, provides a different style of modulus to avoid potential attacks for special polynomial ring structures and optimizes the polynomial multiplication algorithm of the bit-level secret and noise. Based on these techniques, LAC reduces the public key to 544–1056 bytes and the ciphertext to 664–1464 bytes. Meanwhile, it achieves similar computational performance compared with NTT technique schemes. By observing the asymmetries in lattice-based cryptosystems, Zhang and Yu et al. [6] proposed asymmetric MLWE and asymmetric MSIS problems, which yield further size-optimized KEMs and signature schemes to those from standard counterparts. Compared to the seven NIST round-three candidates at Category III security, their KEM scheme has parameters (public key + ciphertext size) smaller than Classic McEliece, CRYSTALS-Kyber, NTRU and Saber; their signature scheme has parameters (public key + signature size) smaller than CRYSTALS-Dilithium and Rainbow, but slightly larger than FALCON, where CRYSTALS-Kyber, NTRU, Saber, CRYSTALS-Dilithium and FALCON are lattice-based schemes. One important application of lattice-based PKEs/KEMs is to build authenticated key exchange (AKE), which could provide additional authentication to the established session key. There are several generic ways to construct AKE from lattice-based PKEs/KEMs. In the PKE setting, Xue and Lu et al. [7] proposed a more compact KEM-based framework via a new primitive named ‘2-key KEM’, which shares some item between different ciphertexts. In the only password setting, Zhang and Yu [8] presented a two-round PAKE framework from the splittable-PKEs that can be instantiated from lattices. The only known AKE that does not rely on lattice-based PKEs/KEMs was given in Ref. [9], which has two-round messages and provides implicit authentication. This work was supported by the National Natural Science Foundation of China (6197239 to X.L.; 62022018 and 61932019 to J.Z.) and the National Key Research and Development Program of China (2018YFB0804105 to J.Z.). Conflict of interest statement. None declared.

National Science Review•May 20, 2021•2 citations

CYBERSECURITY IN THE QUANTUM ERA

Hemant N Chaudhari, Vinay T Patil, Alberto Lacava

Quantum computing’s arrival signals a paradigm shift in computational power that may transform several sectors, including drug discovery, artificial intelligence, materials research, and optimization [2]. However, this transformative potential also presents a significant and imminent threat to cybersecurity. At the heart of this technological shift is the ability of quantum computers to tackle the complex mathematical challenges on which modern public-key cryptography relies. Quantum algorithms, most notably Shor’s algorithm, can break problems such as integer factorization and discrete logarithms far more efficiently than classical approaches. As a result, cryptographic methods that are widely trusted today—including RSA and Elliptic Curve Cryptography (ECC)—could become insecure once large-scale quantum computing becomes a reality[1], [8].This poses a profound challenge to the confidentiality, integrity, and authenticity of digital communications, financial networks, essential infrastructure, and national defense systems [9]. To counter this emerging risk, Post-Quantum Cryptography (PQC) has become an important area of active research. The goal of PQC is to design cryptographic techniques that can withstand attacks from both conventional computers and future quantum systems, thereby preserving long-term data security in the face of advancing quantum technologies [3].A number of promising Post-Quantum Cryptography (PQC) approaches are currently being explored in depth. Among them, lattice-based cryptography has attracted significant interest, as it relies on the computational difficulty of problems like Learning With Errors (LWE) and the Shortest Vector Problem (SVP), offering both robust security assurances and practical efficiency [4], [5]. Hash-based signature schemes, such as XMSS and SPHINCS+, offer security rooted in well-established hashing techniques and stateless signature construction [7]. Additionally, code-based cryptography, including systems inspired by the McEliece cryptosystem, remains attractive for its long-standing resistance to cryptanalytic attacks [6]. Other avenues include multivariate quadratic systems and isogeny-based cryptography, each presenting unique benefits and trade-offs in terms of key size, performance, and security robustness [8].A central force driving global standardization is the NIST Post-Quantum Cryptography Standardization Project, initiated in 2016 to evaluate and establish new quantum-resilient cryptographic standards [3]. Several algorithms have already advanced to the final standardization phase, while others remain candidates for further evaluation.Despite this progress, transitioning to PQC introduces practical challenges. Integrating new cryptographic algorithms into current digital ecosystems demands considerable computational and infrastructural updates, often involving larger key sizes and increased processing overhead [10]. Organizations must also ensure crypto-agility, the capability to rapidly adapt cryptographic systems as new standards evolve or vulnerabilities are identified [11].One strategic transition approach involves hybrid cryptographic architectures, which combine conventional and quantum-safe algorithms to provide layered security during this migration period [9]. Moreover, organizations should inventory existing cryptographic assets, conduct quantum risk assessments, pilot PQC deployments, and cultivate a quantum-aware cybersecurity workforce.The threat is amplified by “harvest now, decrypt later” strategies, in which adversaries intercept encrypted data today with the intention of decrypting it once quantum capabilities mature [9]. Particularly sensitive categories — including military communications, governmental archives, personal healthcare records, and intellectual property — require immediate PQC-oriented protection.As the quantum era approaches, coordinated global action is essential to harness quantum innovation while safeguarding digital trust. Through proactive investment in research, standardization efforts, and phased post-quantum deployment, societies can preserve digital sovereignty and security resilience in the face of this technological shift [11].

Iterative International Publishers eBooks•Jun 1, 2026•0 citations

Research into the current state of quantum secret key distribution technologies

Serhiy Lenkov, Володимир Миколайович Джулій, Ihor Muliar +1 more

The work is devoted to the study of the problems of using the technology of quantum distribution of secret keys, namely the problems of using and forming new secret keys, based on the generation of quantum keys and the distribution of new keys in networks of complex topologies. In secure communication systems, information is transmitted over public networks, and thus is available to a potential attacker for carrying out various types of attacks. A potential attacker is able to store encrypted data transmitted over network channels, and attempt to decrypt it later, when technical means and attacks on information protection algorithms will allow, in an acceptable time, to carry out decryption. This is the basic principle of "Store now, decrypt later", which is one of the problems of information protection systems. For block ciphers, there is a parameter - the key load, which limits the amount of information that one key can process using the data protection algorithm. NIST recommends a time frame for using secret keys, calculated in years. In the field of information security, there are more significant restrictions on the key load, related to the number of blocks that can be processed by one key, caused by attacks on block ciphers. With these restrictions, there is a need to regularly change the secret key used, and search for options for generating and delivering keys between two network nodes that organize a secure information transmission channel. Changing the secret key to a new key, independent of the previous one, allows you to protect the transfer of confidential information when the key used is compromised. The technology of creating a quantum computer allows you to effectively attack known algorithms for generating secret keys based on the factorization of large numbers or the complexity of calculating a discrete logarithm. The quantum Shor algorithm [5, 6] allows you to solve these problems in polynomial time, so it is necessary to look for alternative solutions to the problem of regular changes in the network channel of the secret key in a pair of nodes. It is important to take into account the need to ensure the quality of Perfect forward secrecy, when the master key is compromised, all subsequent secret keys must not be compromised. To achieve this property of modern encryption algorithms, there is a periodic update of master keys. To prevent the accumulation of information, to successfully carry out attacks by the attacker and to comply with the load requirement on the secret key, it is necessary to solve the problem of regular changes of the secret, and regular generation/delivery of keys to network nodes. Given the urgent needs that are intensively developing today in the secure and high-speed transmission of information, and no less, the rapid growth of technical capabilities, there is a need to develop options in advance that will ensure the security of information during transmission. Regular change, in geographically dispersed data protection systems, of common secret keys, in the case of ensuring the independence of secret keys, allows successfully solving the task.

Smart technologies Industrial and Civil Engineering•May 14, 2025•0 citations

*Quantum-Secure Cryptography

Jonathan I. Katz, Yehuda Lindell

So far in this book (cf. Section 3.1.2 ), we have equated the notion of “efficient adversaries” with adversarial algorithms running in (probabilistic) polynomial-time on a classical computer . Thus, when evaluating the security of our schemes we only considered efficient classical attacks. We did not, however, consider the potential impact of quantum computers —that is, computers that rely in an essential way on the principles of quantum mechanics. As we will see here, quantum algorithms can in some cases be faster than classical algorithms—possibly much faster—and thus quantum computers can have a dramatic impact on the security of cryptosystems.

Chapman & Hall/CRC eBooks•May 14, 2025•0 citations
GRID computing includes applications, some of which are intelligence sensitive (genetics, space, industrial intellectual property, etc) and need to remain confidential. Current security is mostly based based on public (asymmetric) key algorithms (Salomaa, 1996) – hash function algorithms easy to calculate in direct, but estimated as impossible in reverse. The base assumption to this assertion is the difficulty of factorising prime numbers. This received however a serious blow in 1994 (Shor, 1994), when it was shown that (a hypothetical future) quantum computer could rapidly factorise prime numbers via a polynomial algorithm. As such messages could be intercepted and stored today awaiting for the availability of quantum processors, when they could conceivably be deciphered. Evidently, data with short “life-span” (2-5 years) is perfectly safe today, however censi, geological data, etc have long-term implications and need to be adequately protected. The other main security contender currently in use is the symmetric-key AES encryption (Daemen and Rijmen, 1996-2001 and 2006), that comes in 3 versions of key length 128, 192 and 256 bit (with 10, 12, and 14 rounds, respectively). For AES-128 there is no known attack faster than the 2128 complexity of exhaustive search. However, AES-192 and AES-256 were recently shown (Biryukov and Khovratovich, 2009) to be breakable by attacks of 2176 and 2119 complexities. While these are much faster than the exhaustive search, they are non-practical, and do not to pose a real threat (at the rate the world produces today data, ca. 0.2⋅1021 bytes/year (261 × 256-bit ciphertexts) it would take 258 ≅ 1017 years data’s worth to recover just one AES key). The US National Security Agency (Hathaway, 2003) stated that “The design and strength of all key lengths of the AES algorithm (i.e., 128, 192 and 256) are sufficient to protect classified information up to the secret level.” From this assessment and the simple estimates above, it is apparent that given adequate key distribution protection AES cannot be broken – at least not in the next 1017 years (for 1 key). The secret key carrier on the other hand needs to be a stable long-term committed technology, that would not come under question any time soon (including from futuristic quantum processor attacks).
Traditionally, information security needed encryption, authentication, key management, non-repudiation and authorization which were being met using several techniques. Standardization of algorithms by National Institute of Standards and Technology (NIST) has facilitated international communication for banking and information transfer using these standards. Encryption can be carried out using Advanced Encryption Standard (AES) using variable block lengths (128, 192 or 256 bits) and variable key lengths (128, 192 or 256 bits). Solutions for light weight applications such as those for Internet of Things (IoT) are also being standardized. Message integrity is possible using host of hash algorithms such as SHA-1, SHA-2 etc., and more recently using SHA-3 algorithm. Authentication is possible using well known Rivest-Shamir-Adleman (RSA) algorithm needing 2048/4096 bit operations. Elliptic Curve Cryptography (ECC) is also quite popular and used in several practical systems such as WhatsApp, Blackberry etc. Key exchange is possible using Diffie-Hellman algorithm and its variations. Digital Signatures can be carried out using RSA algorithm or Elliptic Curve Digital Signature Algorithm (ECDSA) or DSA (Digital Signature Algorithm). All these algorithms derive security from difficulty in solving some mathematical problems such as factorization problem or discrete logarithm problem. Though published literature gives evidence of solving factorization problem upto 768 bits only, it is believed that using Quantum computers, these problems could be solved by the end of this decade. This is due to availability of the pioneering work of Shor and Grover [1]. For factoring an integer of N bits, Shor’s algorithm takes quantum gates. As such, there is ever growing interest in being ready for the next decade with algorithms that may resist attacks in the quantum computer era. NIST has foreseen this need and has invited proposals from researchers all over the world. In the first round, about 66 submissions were received which have been scrutinized for completeness of submissions , novelty of the approach and security and 25 of these were promote to second round to improve based on the comments received on the first round submission. These will be analyzed for security and some will be selected for final recommendation for use by industry. These are for encryption/decryption, key agreement, hashing and Digital Signatures for both hardware and software implementations. In this paper, we present a brief survey of the state of the art in post-Quantum Cryptography (PQC) followed by study of one of technique referred to as Learning With Errors (LWE) in some detail.
The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.
The invention of public-key cryptography (PKC) by Diffie and Hellman in 1976 is one of two milestones marking the beginning of modern cryptography. The security of a PKC system requires that it should be infeasible to compute the private key from a given public key, which in turn is typically guaranteed by the difficulty in solving some cryptographic-friendly mathematical problems. Among those problems, the integer factorization and discrete logarithm problems play pivotal roles in the development of public-key cryptography. In particular, the assumption that there is no polynomial time (classical) algorithm that solves the above two problems constitutes the basis for the security of almost all currently used public-key cryptosystems, such as RSA and ElGamal. However, Shor [1] found an efficient quantum solving algorithm for the integer factorization and discrete logarithm problems in 1994, which would destroy the security basis for most real deployed PKC systems if large-scale quantum computers become available. The rapid development of quantum technology in recent years suggests that we are getting closer to the quantum crisis of current PKC systems. As a response to the quantum crisis, the research community has made many efforts to post-quantum cryptography (PQC) that are believed to resist quantum computer attacks. Lattice-based cryptography is one of the main directions in this area, and has become the most promising PQC candidate for standardization. The research of lattice-based cryptography dates back to the seminal work of Ajtai [2], which first based the security of cryptographic primitives on the difficulty of solving some lattice problems such as the approximate shortest vector problem and the closest vector problem. After more than two decades of development, lattice-based cryptography has gained substantial progress. In theory, we have witnessed the construction of many powerful cryptographic primitives that were not known before. In practice, the public key size of lattice-based cryptosystems has been significantly reduced from several gigabytes to a few kilobytes. For current applications and standardization, key exchanges, public-key encryptions (PKEs) and signatures are the most desired lattice-based cryptosystems, where the first two are often used to ensure information secrecy, while the last provides information authentication. Note that public-key encryptions are equivalent to two-round key exchanges, also known as the key encapsulation mechanism (KEM). In the following, we focus on lattice-based PKEs/KEMs. The design principle of lattice-based PKEs/KEMs follows two approaches: a trapdoor one-way function and an approximate commutative one-way function. In the first approach, a trapdoor one-way function f and its trapdoor f−1 are generated as the public key and private key. A plaintext m is encrypted as c = f(m), and the ciphertext is decrypted as m = f−1(c). The NTRU scheme and its variants follow such an approach. In the second approach, an approximate commutative function fs and a random input a are generated, the public key is (a, b = fs(a)) and the private key is s. A plaintext m is encrypted as c1 = gr(a), c2 = gr(b) + E(m), where r is a random element, g is an approximate commutative one-way function and E is the encoding of an error-correction code. The ciphertext (c1, c2) is decrypted as m = D(c2 − fs(c1)), where D is the decoding of an error-correction code. The correctness of decryption is guaranteed by the approximate commutative property (gr(b) = gr(fs(a)) ≈ fs(gr(a)) = fs(c1)) and the error-correction code. Learning with errors (LWE) problem-based PKE/KEM schemes and their variants follow such an approach. The standardization of PQC has received substantial support from national funding agencies, such as the European Union projects PQCrypto and SAFEcrypto. The USA National Institute of Standard and Technology (NIST) started the post-quantum standardization project in 2012, organized a worldwide ‘competition’ in 2016 and plans to deliver draft standards before 2024. After two rounds of evaluation, seven schemes were accepted as the round-three candidates on 22 July 2020, of which five are lattice-based schemes. In 2017, the International organization for standardization started a study project of post-quantum cryptography named SD8. Most LWE-based PKE schemes such as Kyber and LAC follow the Lindner-Peikert framework [3] up to the choices of ring structure, noise distribution and parameters. As the size of noise in lattice-based PKEs/EKMs is typically larger than the lower bits of the ciphertext, many schemes often artificially drop a few lower bits to optimize the practical performance without significantly increasing the final decryption noise. Kyber [4] is one of the most promising PKE/KEM candidates in the NIST PQC standardization, whose security is provably based on the difficulty of so-called module LWE (MLWE) problems. The use of MLWE allowed Kyber to obtain additional flexibility and security advantages, while keeping the same efficiency as those based on the ring-LWE problems. The strategy of dropping some lower bits is used to compress both the public-key and ciphertext sizes. For a targeted 128-bit quantum security, the public-key and ciphertext sizes of Kyber is around a single kilobyte. LAC [5] uses several techniques to reduce the modulus as small as possible: it uses a byte-level modulus, embeds powerful error-correcting codes to maximize the noise-modulus rate, provides a different style of modulus to avoid potential attacks for special polynomial ring structures and optimizes the polynomial multiplication algorithm of the bit-level secret and noise. Based on these techniques, LAC reduces the public key to 544–1056 bytes and the ciphertext to 664–1464 bytes. Meanwhile, it achieves similar computational performance compared with NTT technique schemes. By observing the asymmetries in lattice-based cryptosystems, Zhang and Yu et al. [6] proposed asymmetric MLWE and asymmetric MSIS problems, which yield further size-optimized KEMs and signature schemes to those from standard counterparts. Compared to the seven NIST round-three candidates at Category III security, their KEM scheme has parameters (public key + ciphertext size) smaller than Classic McEliece, CRYSTALS-Kyber, NTRU and Saber; their signature scheme has parameters (public key + signature size) smaller than CRYSTALS-Dilithium and Rainbow, but slightly larger than FALCON, where CRYSTALS-Kyber, NTRU, Saber, CRYSTALS-Dilithium and FALCON are lattice-based schemes. One important application of lattice-based PKEs/KEMs is to build authenticated key exchange (AKE), which could provide additional authentication to the established session key. There are several generic ways to construct AKE from lattice-based PKEs/KEMs. In the PKE setting, Xue and Lu et al. [7] proposed a more compact KEM-based framework via a new primitive named ‘2-key KEM’, which shares some item between different ciphertexts. In the only password setting, Zhang and Yu [8] presented a two-round PAKE framework from the splittable-PKEs that can be instantiated from lattices. The only known AKE that does not rely on lattice-based PKEs/KEMs was given in Ref. [9], which has two-round messages and provides implicit authentication. This work was supported by the National Natural Science Foundation of China (6197239 to X.L.; 62022018 and 61932019 to J.Z.) and the National Key Research and Development Program of China (2018YFB0804105 to J.Z.). Conflict of interest statement. None declared.
Quantum computing’s arrival signals a paradigm shift in computational power that may transform several sectors, including drug discovery, artificial intelligence, materials research, and optimization [2]. However, this transformative potential also presents a significant and imminent threat to cybersecurity. At the heart of this technological shift is the ability of quantum computers to tackle the complex mathematical challenges on which modern public-key cryptography relies. Quantum algorithms, most notably Shor’s algorithm, can break problems such as integer factorization and discrete logarithms far more efficiently than classical approaches. As a result, cryptographic methods that are widely trusted today—including RSA and Elliptic Curve Cryptography (ECC)—could become insecure once large-scale quantum computing becomes a reality[1], [8].This poses a profound challenge to the confidentiality, integrity, and authenticity of digital communications, financial networks, essential infrastructure, and national defense systems [9]. To counter this emerging risk, Post-Quantum Cryptography (PQC) has become an important area of active research. The goal of PQC is to design cryptographic techniques that can withstand attacks from both conventional computers and future quantum systems, thereby preserving long-term data security in the face of advancing quantum technologies [3].A number of promising Post-Quantum Cryptography (PQC) approaches are currently being explored in depth. Among them, lattice-based cryptography has attracted significant interest, as it relies on the computational difficulty of problems like Learning With Errors (LWE) and the Shortest Vector Problem (SVP), offering both robust security assurances and practical efficiency [4], [5]. Hash-based signature schemes, such as XMSS and SPHINCS+, offer security rooted in well-established hashing techniques and stateless signature construction [7]. Additionally, code-based cryptography, including systems inspired by the McEliece cryptosystem, remains attractive for its long-standing resistance to cryptanalytic attacks [6]. Other avenues include multivariate quadratic systems and isogeny-based cryptography, each presenting unique benefits and trade-offs in terms of key size, performance, and security robustness [8].A central force driving global standardization is the NIST Post-Quantum Cryptography Standardization Project, initiated in 2016 to evaluate and establish new quantum-resilient cryptographic standards [3]. Several algorithms have already advanced to the final standardization phase, while others remain candidates for further evaluation.Despite this progress, transitioning to PQC introduces practical challenges. Integrating new cryptographic algorithms into current digital ecosystems demands considerable computational and infrastructural updates, often involving larger key sizes and increased processing overhead [10]. Organizations must also ensure crypto-agility, the capability to rapidly adapt cryptographic systems as new standards evolve or vulnerabilities are identified [11].One strategic transition approach involves hybrid cryptographic architectures, which combine conventional and quantum-safe algorithms to provide layered security during this migration period [9]. Moreover, organizations should inventory existing cryptographic assets, conduct quantum risk assessments, pilot PQC deployments, and cultivate a quantum-aware cybersecurity workforce.The threat is amplified by “harvest now, decrypt later” strategies, in which adversaries intercept encrypted data today with the intention of decrypting it once quantum capabilities mature [9]. Particularly sensitive categories — including military communications, governmental archives, personal healthcare records, and intellectual property — require immediate PQC-oriented protection.As the quantum era approaches, coordinated global action is essential to harness quantum innovation while safeguarding digital trust. Through proactive investment in research, standardization efforts, and phased post-quantum deployment, societies can preserve digital sovereignty and security resilience in the face of this technological shift [11].
The work is devoted to the study of the problems of using the technology of quantum distribution of secret keys, namely the problems of using and forming new secret keys, based on the generation of quantum keys and the distribution of new keys in networks of complex topologies. In secure communication systems, information is transmitted over public networks, and thus is available to a potential attacker for carrying out various types of attacks. A potential attacker is able to store encrypted data transmitted over network channels, and attempt to decrypt it later, when technical means and attacks on information protection algorithms will allow, in an acceptable time, to carry out decryption. This is the basic principle of "Store now, decrypt later", which is one of the problems of information protection systems. For block ciphers, there is a parameter - the key load, which limits the amount of information that one key can process using the data protection algorithm. NIST recommends a time frame for using secret keys, calculated in years. In the field of information security, there are more significant restrictions on the key load, related to the number of blocks that can be processed by one key, caused by attacks on block ciphers. With these restrictions, there is a need to regularly change the secret key used, and search for options for generating and delivering keys between two network nodes that organize a secure information transmission channel. Changing the secret key to a new key, independent of the previous one, allows you to protect the transfer of confidential information when the key used is compromised. The technology of creating a quantum computer allows you to effectively attack known algorithms for generating secret keys based on the factorization of large numbers or the complexity of calculating a discrete logarithm. The quantum Shor algorithm [5, 6] allows you to solve these problems in polynomial time, so it is necessary to look for alternative solutions to the problem of regular changes in the network channel of the secret key in a pair of nodes. It is important to take into account the need to ensure the quality of Perfect forward secrecy, when the master key is compromised, all subsequent secret keys must not be compromised. To achieve this property of modern encryption algorithms, there is a periodic update of master keys. To prevent the accumulation of information, to successfully carry out attacks by the attacker and to comply with the load requirement on the secret key, it is necessary to solve the problem of regular changes of the secret, and regular generation/delivery of keys to network nodes. Given the urgent needs that are intensively developing today in the secure and high-speed transmission of information, and no less, the rapid growth of technical capabilities, there is a need to develop options in advance that will ensure the security of information during transmission. Regular change, in geographically dispersed data protection systems, of common secret keys, in the case of ensuring the independence of secret keys, allows successfully solving the task.
So far in this book (cf. Section 3.1.2 ), we have equated the notion of “efficient adversaries” with adversarial algorithms running in (probabilistic) polynomial-time on a classical computer . Thus, when evaluating the security of our schemes we only considered efficient classical attacks. We did not, however, consider the potential impact of quantum computers —that is, computers that rely in an essential way on the principles of quantum mechanics. As we will see here, quantum algorithms can in some cases be faster than classical algorithms—possibly much faster—and thus quantum computers can have a dramatic impact on the security of cryptosystems.