Post-quantum cryptography
Open accessThe DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.
Abstract
Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, the authors of [183] showed that almost all of the current public-key mechanisms can be broken by Shor's algorithms [184].”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Post-quantum cryptography (PQC) refers to a new generation of asymmetric algorithms that cannot be broken by Shor’s algorithm and therefore are considered quantum-resistant.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [23]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“However, numerous shortcomings of the aforementioned approaches are mentioned in [183].”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
The cited source says what the claim attributes to it.
In the citing paper
“As pointed out in [183], post-quantum cryptosystems still need varying designs alongside techniques for optimization and implementation.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
The cited source says what the claim attributes to it.
In the citing paper
“Authors in [183] have shown five key approaches for which no known way of applying the Shor's algorithm exists.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [183]
4 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 3×
“RSA-3072 [7] signature 128 broken (Shor)”
InfluentialA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · cited 1×
“Many more cryptographic systems are affected by an algorithm that Grover [18] intro-”
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 13×
“For example, very recently the “cyclotomic” structure of x p − 1 has been used to break [18, 19, 20] some lattice-based cryptosystems by an extension of Shor’s algorithm.”
InfluentialKocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634 · cited 2×
“Replacing multiplication mod p with addition of points on an “elliptic curve” mod p breaks “elliptic-curve cryptography” [11, 12] (ECC), a popular alternative to RSA.”
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387 · cited 1×
“The most important examples are “side-channel attacks”, in which the attacker learns extra information by observing timing [49], power consumption [50], etc.”
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
The design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
Daemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315 · cited 2×
“There are many potential attack avenues against NTRU and other lattice-based cryptosystems (such as cryptosystems based on “Ring-LWE” [17]).”
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239 · cited 1×
“256-bit ECDSA [14, 15] signature 128 broken (Shor)”
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 1×
“In the 1990s Hoffstein, Pipher, and Silverman [16] introduced an encryption system “NTRU” that has much smaller keys than McEliece’s system and that remains unbroken today.”
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691 · cited 1×
“To overcome the problems of large public keys that could be used only once, Merkle proposed [48, 49] to combine 2k public keys into one which can then be used to verify all 2k signatures.”
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_2 · Cited by 1,604
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Self-citationOn Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836 · cited 1×
“There are many potential attack avenues against NTRU and other lattice-based cryptosystems (such as cryptosystems based on “Ring-LWE” [17]).”
Lattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827 · cited 1×
“The most promising signature systems are based on Lyubashevsky’s signature system [40] from 2012.”
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
Patarin, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_4 · Cited by 662
Constructing Digital Signatures from a One Way Function
Lamport, L. (2016) · Cited by 649
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
Jao, D., & De Feo, L. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_2 · Cited by 634
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Knapsack-type cryptosystems and algebraic coding theory
Niederreiter, H. (1986) · Medical Entomology and Zoology · Cited by 587
Lattice Signatures and Bimodal Gaussians
Ducas, L., Durmus, A., Lepoint, T., & Lyubashevsky, V. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_3 · Cited by 557 · cited 2×
“Later proposals such as BLISS [41] improve the running time by reducing the frequency of rejection in the last step.”
High-speed high-security signatures
Bernstein, D. J., Duif, N., Lange, T., Schwabe, P., & Yang, B.-Y. (2012) · Journal of Cryptographic Engineering · doi:10.1007/s13389-012-0027-1 · Cited by 541
Self-citationThe Security and Performance of the Galois/Counter Mode (GCM) of Operation
McGrew, D. A., & Viega, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30556-9_27 · Cited by 522
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Etessami, K., & Yannakakis, M. (2009) · Journal of the ACM · doi:10.1145/1462153.1462154 · Cited by 512
Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
Matsumoto, T., & Imai, H. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-45961-8_39 · Cited by 504 · cited 1×
“9 Multivariate-quadratic-equation signatures Matsumoto and Imai [35] introduced a new signature system “C ∗ ” in 1988.”
Public-key cryptosystems from lattice reduction problems
Goldreich, O., Goldwasser, S., & Halevi, S. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052231 · Cited by 482 · cited 1×
“The first attempts [37, 38, 39] to turn hard lattice problems into signature systems were marred by attacks and surviving systems suffered from large signature sizes.”
The Salsa20 Family of Stream Ciphers
Bernstein, D. J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_8 · Cited by 429 · cited 1×
“Salsa20 [2] stream cipher 256 128 (Grover)”
Self-citationCryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88
Patarin, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_20 · Cited by 394
SPHINCS: Practical Stateless Hash-Based Signatures
Bernstein, D. J., Hopwood, D., Hülsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., & Wilcox-O’Hearn, Z. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_15 · Cited by 374 · cited 1×
“For such applications stateless systems exist [55] but this feature comes”
Self-citationThe Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_3 · Cited by 362
Self-citationA Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Kuperberg, G. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539703436345 · Cited by 347 · cited 1×
“We do not describe isogeny-based cryptography [20, 21, 22], for example, and we do not discuss Kuperberg’s algorithm [23].”
Attacking and Defending the McEliece Cryptosystem
Bernstein, D. J., Lange, T., & Peters, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88403-3_3 · Cited by 341 · cited 1×
“McEliece’s original key sizes were designed for 264 security, and our successful attack against those key sizes thirty years later [25] took more than 260 CPU cycles.”
Self-citationXMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Buchmann, J., Dahmen, E., & Hülsing, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_8 · Cited by 312 · cited 2×
“A system based on XMSS [52, 53] is currently in the final steps of adoption for Internet”
NTRUSign: Digital Signatures Using the NTRU Lattice
Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J. H., & Whyte, W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_9 · Cited by 302 · cited 1×
“The first attempts [27, 28, 29] to turn hard lattice problems into signature systems were marred by attacks [30, 31] and surviving systems suffered from large signature sizes.”
Applying Grover’s Algorithm to AES: Quantum Resource Estimates
Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_3 · Cited by 299
New directions in nearest neighbor searching with applications to lattice sieving
Becker, A., Ducas, L., Gama, N., & Laarhoven, T. (2016) · Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms · doi:10.1137/1.9781611974331.ch2 · Cited by 287 · cited 1×
“As another example, recent attacks [34, 35, 36] that work for arbitrary lattices, without exploiting any polynomial structure, have smaller exponents than the best such attacks known just a few years ago.”
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_19 · Cited by 265
New Stream Cipher Designs: The eSTREAM Finalists
(2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3 · Cited by 263
Topics in Cryptology — CT-RSA 2003
Jóye, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x · Cited by 226
Public-Key Cryptosystem Based on Isogenies.
Rostovtsev, A., & Stolbunov, A. (2006) · Cited by 216
Johansson, T., & Nguyễn, P. Q. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9 · Cited by 215
Circuit for Shor's algorithm using 2n+3 qubits
Beauregard, S. (2003) · Quantum Information and Computation · doi:10.26421/qic3.2-8 · Cited by 206
Public-Key Cryptosystem Based on Isogenies.Preprint
Rostovtsev, A., & Stolbunov, A. (2006) · IACR Cryptology ePrint Archive · Cited by 202
W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
Hülsing, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38553-7_10 · Cited by 195 · cited 1×
“Various improvements exist: using better one-time signatures [43, 44] to decrease the signature size, for example, or building trees of trees to reduce key-generation time.”
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Laarhoven, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6_1 · Cited by 171 · cited 1×
“As another example, recent attacks [34, 35, 36] that work for arbitrary lattices, without exploiting any polynomial structure, have smaller exponents than the best such attacks known just a few years ago.”
(1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9 · Cited by 168
Flush, Gauss, and Reload – A Cache Attack on the BLISS Lattice-Based Signature Scheme
Groot Bruinderink, L., Hülsing, A., Lange, T., & Yarom, Y. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53140-2_16 · Cited by 167
Self-citationMcBits: Fast Constant-Time Code-Based Cryptography
Bernstein, D. J., Chou, T., & Schwabe, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40349-1_15 · Cited by 158 · cited 1×
“As a final example, a state-of-the-art implementation [51] of McEliece’s code-based system takes even less processing time than ECC; the only serious obstacle to wide deployment of this system is its key size.”
Self-citationBernstein, D. J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_6 · Cited by 158 · cited 1×
“The only post-quantum change in c has been a straightforward application [14] of Grover’s algorithm, replacing c with √ c .”
Self-citationAdvances in Cryptology — CRYPTO ’85 Proceedings
(1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x · Cited by 158
NSS: An NTRU Lattice-Based Signature Scheme
Hoffstein, J., Pipher, J. C., & Silverman, J. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_14 · Cited by 147 · cited 1×
“The first attempts [27, 28, 29] to turn hard lattice problems into signature systems were marred by attacks [30, 31] and surviving systems suffered from large signature sizes.”
Couveignes, J.-M. (2006) · Cited by 139
Short Stickelberger Class Relations and Application to Ideal-SVP
Cramer, R., Ducas, L., & Wesolowski, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_12 · Cited by 138 · cited 1×
“For example, very recently the “cyclotomic” structure of xp − 1 has been used to break [18, 19, 20] some lattice-based cryptosystems by an extension of Shor’s algorithm.”
Advances in Cryptology — CRYPTO’ 89 Proceedings
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34805-0 · Cited by 131
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Nguyễn, P. Q., & Regev, O. (2006) · Lecture notes in computer science · doi:10.1007/11761679_17 · Cited by 130
Hash Based Digital Signature Schemes
Dods, C., Smart, N. P., & Stam, M. (2005) · Lecture notes in computer science · doi:10.1007/11586821_8 · Cited by 126
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_27 · Cited by 125 · cited 1×
“The first attempts [27, 28, 29] to turn hard lattice problems into signature systems were marred by attacks [30, 31] and surviving systems suffered from large signature sizes.”
Design Principles for HFEv- Based Multivariate Signature Schemes
Petzoldt, A., Chen, M.-S., Yang, B., Tao, C., & Ding, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6_14 · Cited by 123 · cited 1×
“The same type of analysis used for recent pre-quantum parameter choices [46] indicates that m = 240, n−v = 256, and n = 272 provide high post-quantum security against known attacks even if d is quite small.”
Advances in Cryptology - EUROCRYPT 2006
Serge Vaudenay, B., & 2006, E. (2006) · Lecture notes in computer science · doi:10.1007/11761679 · Cited by 102
Biasse, J., & Song, F. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch64 · Cited by 100 · cited 1×
“For example, very recently the “cyclotomic” structure of xp − 1 has been used to break [29, 30, 31] some lattice-based cryptosystems by an extension of Shor’s algorithm.”
Optimal Parameters for XMSS MT
Hülsing, A., Rausch, L., & Buchmann, J. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4_14 · Cited by 86 · cited 1×
“A system based on XMSS [45, 46] is currently in the final steps of adoption for Internet protocols by the Internet Research Task Force (IRTF).”
Dugardin, M., Guilley, S., Danger, J., Najm, Z., & Rioul, O. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53140-2 · Cited by 67
Advances in Cryptology — EUROCRYPT ’88
(1988) · Lecture notes in computer science · doi:10.1007/3-540-45961-8 · Cited by 65
Sendrier, N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2 · Cited by 61
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
Laarhoven, T., & de Weger, B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_6 · Cited by 59 · cited 1×
“As another example, recent attacks [34, 35, 36] that work for arbitrary lattices, without exploiting any polynomial structure, have smaller exponents than the best such attacks known just a few years ago.”
Hutchison, D., Weikum, G., Vardi, M. Y., Tygar, D., Terzopoulos, D., Sudan, M., Steffen, B., Pandu Rangan, C., Nierstrasz, O., Naor, M., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88403-3 · Cited by 55
(1985) · Springer eBooks · doi:10.1007/3-540-39568-7 · Cited by 39
Advances in Cryptology -- ASIACRYPT 2015
Iwata, T., & Cheon, J. H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6 · Cited by 37
Advances in Cryptology -- CRYPTO 2015
Gennaro, R., & Robshaw, M. J. B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47989-6 · Cited by 32
Security Engineering and Intelligence Informatics
Cuzzocrea, A., Kittl, C., Simos, D. E., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4 · Cited by 27
(2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8 · Cited by 25
(2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5 · Cited by 22
Advances in Cryptology — CRYPT0’ 95
(1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4 · Cited by 21
Fluhrer, S. R., McGrew, D. A., & Curcio, M. (2019) · Cited by 19
Wang, X., & Sako, K. (2012) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · doi:10.1007/978-3-642-34961-4 · Cited by 13
Lauter, K., & Rodríguez‐Henríquez, F. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8 · Cited by 4
Research works printed but not linked: 4
- Campbell, P., Groves, M. & Shepherd, D. Soliloquy: a cautionary tale. http://docbox.etsi.org/Workshop/2014/201410_CRYPTO/S07_Systems_and_Attacks/S07_Groves_Annex.pdf (2014)
- Bernstein, D. J., Chuengsatiansup, C., Lange, T. & van Vredendaal, C. NTRU Prime. Preprint at https://eprint.iacr.org/2016/461 (2016)
- Merkle, R. C. Secrecy, Authentication, and Public Key Systems. PhD thesis, Stanford Univ., http://www.merkle.com/papers/Thesis1979.pdf (1979)
- Alkim, E., Ducas, L., Pöppelmann, T. & Schwabe, P. Post-quantum key exchange—a new hope. In 25th USENIX Security Symp. (USENIX Security 16) (eds Holz, T. & Savage, S.) 327–343 (USENIX Association, 2016)
Cited by
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Quantum computing: A taxonomy, systematic review and future directions
Gill, S. S., Kumar, A., Singh, H., Singh, M., Kaur, K., Usman, M., & Buyya, R. (2022) · Software: Practice and Experience · doi:10.1002/spe.3039 · Cited by 476
“The post-quantum cryptosystem is defined as the set of cryptography primitives and protocols that are secure against quantum computer attacks [65] [66] [67] [68] [69].”
BackgroundThe Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet
Cao, Y., Zhao, Y., Wang, Q., Zhang, J., Ng, S. X., & Hanzo, L. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3144219 · Cited by 505
Metadata
- Authors
- Bernstein, D. J., & Lange, T.
- Affiliations
- University of Illinois Chicago (US)
- Eindhoven University of Technology (NL)
- Corresponding author
- Lange, Tanja
- Venue
- Nature
- Published
- 2017-09
- Volume
- 549
- Issue
- 7671
- Pages
- 188-194
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1513904472
- Semantic Scholar
- 99291ce0b97a31c786560241fea62604332afbf5
- Cited by
- 1,242
- References
- 61
- Citations by year
- 2026: 180 · 2025: 238 · 2024: 179 · 2023: 152 · 2022: 73 · 2021: 83 · 2020: 40 · 2019: 42 · 2018: 23 · 2017: 14
- FWCI
- 19.41
- Type
- journal article
- Language
- en
- Open access
- green
- research.tue.nl
- Licence
- other-oa
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- TU/e Research Portal (submittedVersion)
- TU/e Research Portal (submittedVersion, other-oa)
- Funders
- National Science Foundation (1314919)
- European Commission (645622)
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- post-quantum cryptography, quantum computing threats, quantum algorithms, cryptographic security, internet security, cryptosystem design
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.