The DOI matches its Crossref record; 259 of the 259 references it cites were found in a registry or an index.
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Open accessAbstract
The National Institute of Standards and Technology is in the process of selecting public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers. The first round of the NIST Post-Quantum Cryptography Standardization Process began in December 2017 with 69 candidate algorithms that met both the minimum acceptance criteria and submission requirements. The first round lasted until January 2019, during which candidate algorithms were evaluated based on their security, performance, and other characteristics. NIST selected 26 algorithms to advance to the second round for more analysis. The second round continued until July 2020, after which seven 'finalist' and eight 'alternate' candidate algorithms were selected to move into the third round. This report describes the evaluation and selection process, based on public feedback and internal review, of the third-round candidates. The report summarizes each of the 15 third-round candidate algorithms and identifies those selected for standardization, as well as those that will continue to be evaluated in a fourth round of analysis. The public-key encryption and key-establishment algorithm that will be standardized is CRYSTALS-Kyber. The digital signatures that will be standardized are CRYSTALS-Dilithium, Falcon, and SPHINCS+. While there are multiple signature algorithms selected, NIST recommends CRYSTALS-Dilithium as the primary algorithm to be implemented. In addition, four of the alternate key-establishment candidate algorithms will advance to a fourth round of evaluation: BIKE, Classic McEliece, HQC, and SIKE. These candidates are still being considered for future standardization. NIST will also issue a new Call for Proposals for public-key digital signature algorithms to augment and diversify its signature portfolio.
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.
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
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
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
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Schnorr, C. P., & Euchner, M. (1994) · Mathematical Programming · doi:10.1007/bf01581144 · Cited by 1,427
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Introduction to Modern Cryptography
Katz, J., & Lindell, Y. (2007) · doi:10.1201/9781420010756 · Cited by 1,238
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
A new efficient algorithm for computing Gröbner bases (F4)
Faugére, J.-C. (1999) · Journal of Pure and Applied Algebra · doi:10.1016/s0022-4049(99)00005-5 · Cited by 1,145
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034
Self-citationThe random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Giovannetti, V., Lloyd, S., & Maccone, L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.160501 · Cited by 935
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Ducas, L., Kiltz, E., Lepoint, T., et al. (2018) · IACR Trans. Cryptogr. Hardw. Embed. Syst. · doi:10.13154/tches.v2018.i1.238-268 · Cited by 917
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
A new efficient algorithm for computing Gröbner bases without reduction to zero ( F 5 )
Faugère, J. C. (2002) · Proceedings of the 2002 international symposium on Symbolic and algebraic computation · doi:10.1145/780506.780516 · Cited by 785
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Courtois, N., Klimov, A., Patarin, J., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_27 · Cited by 753
Better Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
Patarin, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_4 · Cited by 662
Worst-case to average-case reductions for module lattices
Langlois, A., & Stehlé, D. (2015) · Designs, Codes and Cryptography · doi:10.1007/s10623-014-9938-4 · Cited by 643
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
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
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
Post-quantum key exchange - a new hope.Preprint
Alkım, E., Ducas, L., Pöppelmann, T., & Schwabe, P. (2015) · IACR Cryptology ePrint Archive · Cited by 586
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
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
Unbalanced Oil and Vinegar Signature Schemes
Kipnis, A., Patarin, J., & Goubin, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_15 · Cited by 528
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
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Rainbow, a New Multivariable Polynomial Signature Scheme
Ding, J., & Schmidt, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_12 · Cited by 488
A method for finding codewords of small weight
Stern, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0019850 · Cited by 464
The use of information sets in decoding cyclic codes
Prange, E. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057777 · Cited by 463
Pseudorandom Functions and Lattices
Banerjee, A., Peikert, C., & Rosen, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_42 · Cited by 459
A Modular Analysis of the Fujisaki-Okamoto Transformation
Hofheinz, D., Hövelmanns, K., & Kiltz, E. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70500-2_12 · Cited by 451
Random Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
Misoczki, R., Tillich, J.-P., Sendrier, N., & Barreto, P. S. L. M. (2013) · 2013 IEEE International Symposium on Information Theory · doi:10.1109/isit.2013.6620590 · Cited by 420
Zero-knowledge from secure multiparty computation
Ishai, Y., Kushilevitz, E., Ostrovsky, R., & Sahai, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250794 · Cited by 412
Vignoles, G. L., Charrier, P., Preux, C., & Dubroca, B. (2008) · Transport in Porous Media · doi:10.1007/s11242-007-9167-7 · Cited by 405
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
De Feo, L., Jao, D., & Plût, J. (2014) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2012-0015 · Cited by 405
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (2013) · Journal of Cryptology · doi:10.1007/s00145-011-9114-1 · Cited by 402
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Becker, A., Joux, A., May, A., & Meurer, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_31 · Cited by 398
Cryptanalysis 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
Status report on the first round of the NIST post-quantum cryptography standardization process
Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., et al. (2019) · doi:10.6028/nist.ir.8240 · Cited by 364
Self-citationLattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
Pohst, M. (1981) · ACM SIGSAM Bulletin · doi:10.1145/1089242.1089247 · Cited by 352
Canteaut, A., & Chabaud, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651067 · Cited by 350
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: REGULAR PAPERS
(2022) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2022.3176228 · Cited by 345
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
A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem.Preprint
Ding, J. (2012) · IACR Cryptology ePrint Archive · Cited by 328
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., & Stebila, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978425 · Cited by 320
The SPHINCS + Signature Framework
Bernstein, D. J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., & Schwabe, P. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363229 · Cited by 306
Status report on the second round of the NIST post-quantum cryptography standardization process
Moody, D., Alagic, G., Apon, D. C., Cooper, D. A., Dang, Q. H., Kelsey, J. M., Liu, Y.-K., Miller, C. A., Peralta, R. C., Perlner, R. A., et al. (2020) · doi:10.6028/nist.ir.8309 · Cited by 296
Self-citationNew 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
Lattice Enumeration Using Extreme Pruning
Gama, N., Nguyen, P. Q., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_13 · Cited by 284
Security Bounds for the Design of Code-Based Cryptosystems
Finiasz, M., & Sendrier, N. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_6 · Cited by 260
Efficient Identity-Based Encryption over NTRU Lattices
Ducas, L., Lyubashevsky, V., & Prest, T. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45608-8_2 · Cited by 258
Digital signature standard (DSS)
National Institute of Standards and Technology (US) (2013) · doi:10.6028/nist.fips.186-4 · Cited by 246
Constructing elliptic curve isogenies in quantum subexponential time
Childs, A. M., Jao, D., & Soukharev, V. (2010) · Cited by 239
On insecurity of cryptosystems based on generalized Reed-Solomon codes
SIDELNIKOV, V. M., & SHESTAKOV, S. O. (1992) · Discrete Mathematics and Applications · doi:10.1515/dma.1992.2.4.439 · Cited by 235
Sieve algorithms for the shortest vector problem are practical
Nguyen, P. Q., & Vidick, T. (2008) · Journal of Mathematical Cryptology · doi:10.1515/jmc.2008.009 · Cited by 233
A Compact Hardware Implementation of CCA-Secure Key Exchange Mechanism CRYSTALS-KYBER on FPGA
Xing, Y., & Li, S. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i2.328-356 · Cited by 218
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols
Banerjee, U., Ukyab, T. S., & Chandrakasan, A. P. (2019) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2019.i4.17-61 · Cited by 216
Post-Quantum Authentication in TLS 1.3: A Performance Study
Sikeridis, D., Kampanakis, P., & Devetsikiotis, M. (2020) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24203 · Cited by 216
Efficient distributed quantum computing
Beals, R., Brierley, S., Gray, O., Harrow, A. W., Kutin, S., Linden, N., Shepherd, D., & Stather, M. (2013) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2012.0686 · Cited by 208
Recommendation for Stateful Hash-Based Signature Schemes
Cooper, D. A., Apon, D., Dang, Q. H., Davidson, M. S., Dworkin, M. J., & Miller, C. A. (2020) · doi:10.6028/nist.sp.800-208 · Cited by 206
Self-citationCryptanalysis of the TTM Cryptosystem
Goubin, L., & Courtois, N. T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_4 · Cited by 204
On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
May, A., & Ozerov, I. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_9 · Cited by 199
The Area-Time Complexity of Binary Multiplication
Brent, R. P., & Kung, H. T. (1981) · Journal of the ACM · doi:10.1145/322261.322269 · Cited by 196
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
Guo, Q., Johansson, T., & Stankovski, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53887-6_29 · Cited by 194
Smaller Decoding Exponents: Ball-Collision Decoding
Bernstein, D. J., Lange, T., & Peters, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_42 · Cited by 191
Albrecht, M., Bai, S., & Ducas, L. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53018-4_6 · Cited by 187
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
Howgrave-Graham, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_9 · Cited by 185
Faster exponential time algorithms for the shortest vector problem
Micciancio, D., & Voulgaris, P. (2010) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973075.119 · Cited by 177
Ntru prime: Reducing attack surface at low cost
Bernstein, D. J., Chuengsatiansup, C., Lange, T., & van Vredendaal, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-72565-9_12 · Cited by 177
SoK: Deep Learning-based Physical Side-channel Analysis
Picek, S., Perin, G., Mariot, L., Wu, L., & Batina, L. (2023) · ACM Computing Surveys · doi:10.1145/3569577 · Cited by 177
Post-Quantum TLS Without Handshake Signatures
Schwabe, P., Stebila, D., & Wiggers, T. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3423350 · Cited by 176
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
Breaking Rainbow Takes a Weekend on a Laptop
Beullens, W. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-15979-4_16 · Cited by 170
QUARTZ, 128-Bit Long Digital Signatures: http://www.minrank.org/quartz/
Patarin, J., Courtois, N., & Goubin, L. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_21 · Cited by 167
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
Kiltz, E., Lyubashevsky, V., & Schaffner, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7_18 · Cited by 163
Generic Side-channel attacks on CCA-secure lattice-based PKE and KEMs
Ravi, P., Sinha Roy, S., Chattopadhyay, A., & Bhasin, S. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i3.307-335 · Cited by 163
LWE with Side Information: Attacks and Concrete Security Estimation
Dachman-Soled, D., Ducas, L., Gong, H., & Rossi, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_12 · Cited by 162
Fast Strategies for the Implementation of SIKE Round 3 on ARM Cortex-M4
Anastasova, M., Azarderakhsh, R., & Kermani, M. M. (2021) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2021.3096916 · Cited by 161
Logic Minimization Techniques with Applications to Cryptology
Boyar, J., Matthews, P., & Peralta, R. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9124-7 · Cited by 160
Self-citationThe General Sieve Kernel and New Records in Lattice Reduction
Albrecht, M. R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E. W., & Stevens, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17656-3_25 · Cited by 160
Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography
Barker, E., Chen, L., Roginsky, A., Vassilev, A., & Davis, R. (2018) · doi:10.6028/nist.sp.800-56ar3 · Cited by 158
A Hardware Accelerator for Polynomial Multiplication Operation of CRYSTALS-KYBER PQC Scheme
Yaman, F., Mert, A. C., Öztürk, E., & Savaş, E. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474139 · Cited by 157
The Computational Complexity of Some Problems of Linear Algebra
Buss, J. F., Frandsen, G. S., & Shallit, J. O. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1608 · Cited by 156
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems
Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R. A., Smith-Tone, D., Tillich, J., & Verbel, J. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_17 · Cited by 155
Self-citationOn Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
Albrecht, M. R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56614-6_4 · Cited by 154
Parallel collision search with application to hash functions and discrete logarithms
van Oorschot, P. C., & Wiener, M. J. (1994) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/191177.191231 · Cited by 146
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
Micciancio, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181960 · Cited by 136
VPQC: A Domain-Specific Vector Processor for Post-Quantum Cryptography Based on RISC-V Architecture
Xin, G., Han, J. S., Yin, T., Zhou, Y., Yang, J., Cheng, X., & Zeng, X. (2020) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2020.2983185 · Cited by 136
Xu, Z., Pemberton, O., Roy, S. S., Oswald, D., Yao, W., & Zheng, Z. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3122997 · Cited by 136
Revisiting the Expected Cost of Solving uSVP and Applications to LWE
Albrecht, M. R., Göpfert, F., Virdia, F., & Wunderer, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70694-8_11 · Cited by 135
Cryptanalysis of the Sidelnikov Cryptosystem
Minder, L., & Shokrollahi, A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72540-4_20 · Cited by 133
Revisiting Lattice Attacks on Overstretched NTRU Parameters
Kirchner, P., & Fouque, P.-A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_1 · Cited by 133
Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Saito, T., Xagawa, K., & Yamakawa, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_17 · Cited by 130
Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
Bettale, L., Faugère, J., & Perret, L. (2012) · Designs Codes and Cryptography · doi:10.1007/s10623-012-9617-2 · Cited by 129
The random oracle model: a twenty-year retrospective
Koblitz, N., & Menezes, A. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0094-2 · Cited by 127
Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
Couvreur, A., Gaborit, P., Gauthier-Umaña, V., Otmani, A., & Tillich, J.-P. (2014) · Designs, Codes and Cryptography · doi:10.1007/s10623-014-9967-z · Cited by 125
Masking Kyber: First- and Higher-Order Implementations
Bos, J. W., Gourjon, M., Renes, J., Schneider, T., & van Vredendaal, C. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i4.173-214 · Cited by 123
Efficient Encryption From Random Quasi-Cyclic Codes
Aguilar-Melchor, C., Blazy, O., Deneuville, J.-C., Gaborit, P., & Zemor, G. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2804444 · Cited by 122
Assessing the overhead of post-quantum cryptography in TLS 1.3 and SSH
Sikeridis, D., Kampanakis, P., & Devetsikiotis, M. (2020) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/3386367.3431305 · Cited by 119
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
Ueno, R., Xagawa, K., Tanaka, Y., Ito, A., Takahashi, J., & Homma, N. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i1.296-322 · Cited by 118
Shortest Vector from Lattice Sieving: A Few Dimensions for Free
Ducas, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78381-9_5 · Cited by 117
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
Wieschebrink, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12929-2_5 · Cited by 114
Improved Cryptanalysis of UOV and Rainbow
Beullens, W. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_13 · Cited by 114
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions
Eisenträger, K., Hallgren, S., Lauter, K., Morrison, T., & Petit, C. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_11 · Cited by 113
Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE
Jaques, S., & Schanck, J. M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_2 · Cited by 113
High-Performance Hardware Implementation of CRYSTALS-Dilithium
Beckwith, L., Nguyen, D. T., & Gaj, K. (2021) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/icfpt52863.2021.9609917 · Cited by 112
NTT Multiplication for NTT-unfriendly Rings
Chung, C.-M. M., Hwang, V., Kannwischer, M. J., Seiler, G., Shih, C.-J., & Yang, B. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i2.159-188 · Cited by 111
A Side-Channel Attack on a Masked IND-CCA Secure Saber KEM Implementation
Ngo, K., Dubrova, E., Guo, Q., & Johansson, T. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i4.676-707 · Cited by 109
A distinguisher for high rate McEliece cryptosystems
Faugere, J.-C., Gauthier-Umana, V., Otmani, A., Perret, L., & Tillich, J.-P. (2011) · 2011 IEEE Information Theory Workshop · doi:10.1109/itw.2011.6089437 · Cited by 108
Tighter Proofs of CCA Security in the Quantum Random Oracle Model
Bindel, N., Hamburg, M., Hövelmanns, K., Hülsing, A., & Persichetti, E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36033-7_3 · Cited by 108
Roy, S. S., & Basso, A. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i4.443-466 · Cited by 107
Certificate Transparency Version 2.0
Laurie, B., Messeri, E., & Stradling, R. (2021) · doi:10.17487/rfc9162 · Cited by 107
Cheon, J. H., Jeong, J., & Lee, C. (2016) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157016000371 · Cited by 103
Decoding Linear Codes with High Error Rate and Its Impact for LPN Security
Both, L., & May, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_2 · Cited by 103
Quantum Information Set Decoding Algorithms
Kachigar, G., & Tillich, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_5 · Cited by 97
Masked Accelerators and Instruction Set Extensions for Post-Quantum Cryptography
Fritzmann, T., Beirendonck, M. V., Roy, D. B., Karl, P., Schamberger, T., Verbauwhede, I. M. R., & Sigl, G. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i1.414-460 · Cited by 95
High-Speed Hardware Architectures and FPGA Benchmarking of CRYSTALS-Kyber, NTRU, and Saber
Dang, V. B., Mohajerani, K., & Gaj, K. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2022.3222954 · Cited by 95
On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)
Boyar, J., Peralta, R., & Pochuev, D. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00182-6 · Cited by 93
Self-citationCompact Dilithium Implementations on Cortex-M3 and Cortex-M4
Greconici, D. O. C., Kannwischer, M. J., & Sprenkels, D. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i1.1-24 · Cited by 91
Fast Fourier Orthogonalization
Ducas, L., & Prest, T. (2016) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2930889.2930923 · Cited by 89
Guo, Q., Johansson, T., & Nilsson, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_13 · Cited by 89
NIST Post-Quantum Cryptography- A Hardware Evaluation Study.Preprint
Basu, K., Soni, D., Nabeel, M., & Karri, R. (2019) · IACR Cryptology ePrint Archive · Cited by 87
A Side-Channel-Resistant Implementation of SABER
Beirendonck, M. V., D’Anvers, J.-P., Karmakar, A., Balasch, J., & Verbauwhede, I. M. R. (2021) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3429983 · Cited by 87
Analysis of Information Set Decoding for a Sub-linear Error Weight
Canto Torres, R., & Sendrier, N. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_10 · Cited by 85
Neon NTT: Faster Dilithium, Kyber, and Saber on Cortex-A72 and Apple M1
Becker, H., Hwang, V., Kannwischer, M. J., Yang, B., & Yang, S. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i1.221-244 · Cited by 85
Approx-SVP in Ideal Lattices with Pre-processing
Pellet-Mary, A., Hanrot, G., & Stehlé, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17656-3_24 · Cited by 82
A Hard Crystal - Implementing Dilithium on Reconfigurable Hardware
Land, G., Sasdrich, P., & Güneysu, T. E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97348-3_12 · Cited by 82
Chosen Ciphertext k-Trace Attacks on Masked CCA2 Secure Kyber
Hamburg, M., Hermelink, J., Primas, R., Samardjiska, S., Schamberger, T., Streit, S., Strieder, E., & van Vredendaal, C. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i4.88-113 · Cited by 82
Recommendation for pair-wise key establishment using integer factorization cryptography
Barker, E., Chen, L., Roginsky, A., Vassilev, A., Davis, R., & Simon, S. (2019) · doi:10.6028/nist.sp.800-56br2 · Cited by 81
Implementing CRYSTALS-Dilithium Signature Scheme on FPGAs
Ricci, S., Malina, L., Jedlicka, P., Smékal, D., Hajný, J., Cíbik, P., Dzurenda, P., & Dobias, P. (2021) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3465481.3465756 · Cited by 81
Kyber on ARM64: Compact Implementations of Kyber on 64-Bit ARM Cortex-A Processors
Sanal, P., Karagoz, E., Seo, H., Azarderakhsh, R., & Kermani, M. M. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-90022-9_23 · Cited by 80
Hülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
Dinur, I. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_14 · Cited by 73
Attacking and Defending Masked Polynomial Comparison for Lattice-Based Cryptography
Bhasin, S., D’Anvers, J.-P., Heinz, D., Pöppelmann, T., & Beirendonck, M. V. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i3.334-359 · Cited by 73
QC-MDPC Decoders with Several Shades of Gray
Drucker, N., Gueron, S., & Kostić, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_3 · Cited by 71
NTRU : A new high speed public key cryptosystem
Hoffstein, J. (1996) · International Cryptology Conference · Cited by 66
A Configurable CRYSTALS-Kyber Hardware Implementation with Side-Channel Protection
Jati, A., Gupta, N., Chattopadhyay, A., & Sanadhya, S. K. (2023) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3587037 · Cited by 65
Kuchta, V., Sakzad, A., Stehlé, D., Steinfeld, R., & Sun, S.-F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45727-3_24 · Cited by 63
Efficiently Masking Binomial Sampling at Arbitrary Orders for Lattice-Based Crypto
Schneider, T., Paglialonga, C., Oder, T., & Güneysu, T. E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17259-6_18 · Cited by 62
Dang, V. B., Farahmand, F., Andrzejczak, M., & Gaj, K. (2019) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/icfpt47387.2019.00032 · Cited by 61
Towards post-quantum security for IoT endpoints with NTRU
Guillen, O. M., Pöppelmann, T., Mera, J. M. B., Bongenaar, E. F., Sigl, G., & Sepúlveda, J. (2017) · Design, Automation, and Test in Europe · doi:10.23919/date.2017.7927079 · Cited by 60
Fault-Injection Attacks Against NIST’s Post-Quantum Cryptography Round 3 KEM Candidates
Xagawa, K., Ito, A., Ueno, R., Takahashi, J., & Homma, N. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92075-3_2 · Cited by 60
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
The Full Cost of Cryptanalytic Attacks
Wiener, M. J. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0213-5 · Cited by 58
Resilience of Quantum Random Access Memory to Generic Noise
Hann, C. T., Lee, G., Girvin, S. M., & Jiang, L. (2021) · University of Chicago · doi:10.6082/027wm-z2x67 · Cited by 57
Laarhoven, T., & Mariano, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_14 · Cited by 56
Fault Attacks on CCA-secure Lattice KEMs
Pessl, P., & Prokop, L. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i2.37-60 · Cited by 54
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT
Albrecht, M. R., Deo, A., & Paterson, K. G. (2018) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2018.i3.173-213 · Cited by 54
BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures
Cremers, C. J. F., Düzlü, S., Fiedler, R., Fischlin, M., & Janson, C. (2021) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40001.2021.00093 · Cited by 53
Banquet: Short and Fast Signatures from AES
Baum, C., Guilhem, C. D. D. S., Kales, D., Orsini, E., Schöll, P., & Zaverucha, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75245-3_11 · Cited by 53
Classic McEliece on the ARM Cortex-M4
Chen, M.-S., & Chou, T. (2021) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2021.i3.125-148 · Cited by 53
Mixed Certificate Chains for the Transition to Post-Quantum Authentication in TLS 1.3
Paul, S., Kuzovkova, Y., Lahr, N., & Niederhagen, R. (2022) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3488932.3497755 · Cited by 53
Boorghany, A., Bayat-Sarmadi, S., & Jalili, R. (2015) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2700078 · Cited by 51
Higher-Order Side-Channel Protected Implementations of KECCAK
Groß, H., Schaffenrath, D., & Mangard, S. (2017) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2017.21 · Cited by 50
Esser, A., & Bellini, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97121-2_5 · Cited by 50
Structural cryptanalysis of McEliece schemes with compact keys
Faugère, J.-C., Otmani, A., Perret, L., de Portzamparc, F., & Tillich, J.-P. (2016) · Designs, Codes and Cryptography · doi:10.1007/s10623-015-0036-z · Cited by 49
On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
Sakumoto, K., Shirai, T., & Hiwatari, H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_5 · Cited by 48
Fault Attack on Supersingular Isogeny Cryptosystems
Ti, Y. B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_7 · Cited by 48
Folding BIKE: Scalable Hardware Implementation for Reconfigurable Devices
Richter-Brockmann, J., Mono, J., & Güneysu, T. E. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3078294 · Cited by 47
Loop-Abort Faults on Supersingular Isogeny Cryptosystems
Gélin, A., & Wesolowski, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_6 · Cited by 45
A Finite Regime Analysis of Information Set Decoding Algorithms
Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., & Santini, P. (2019) · Algorithms · doi:10.3390/a12100209 · Cited by 45
Exploiting Determinism in Lattice-based Signatures
Ravi, P., Jhanwar, M. P., Howe, J., Chattopadhyay, A., & Bhasin, S. (2019) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3321705.3329821 · Cited by 44
Efficient Key Recovery for All HFE Signature Variants
Tao, C., Petzoldt, A., & Ding, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84242-0_4 · Cited by 44
BBQ: Using AES in Picnic Signatures
Guilhem, C. D. D. S., Meyer, L. D., Orsini, E., & Smart, N. P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-38471-5_27 · Cited by 43
Shorter Signatures Based on Tailor-Made Minimalist Symmetric-Key Crypto
Dobraunig, C., Kales, D., Rechberger, C., Schofnegger, M., & Zaverucha, G. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3559353 · Cited by 43
Limbo: Efficient Zero-knowledge MPCitH-based Arguments
Guilhem, C. D. D. S., Orsini, E., & Tanguy, T. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3484595 · Cited by 42
Key Recovery Attack for All Parameters of HFE-
Vates, J., & Smith-Tone, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_16 · Cited by 40
Self-citationNew Efficient, Constant-Time Implementations of Falcon.Preprint
Pornin, T. (2019) · IACR Cryptology ePrint Archive · Cited by 40
Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques
Liu, F., Isobe, T., & Meier, W. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84252-9_13 · Cited by 40
Anonymous, Robust Post-quantum Public Key Encryption
Grubbs, P., Maram, V., & Paterson, K. G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07082-2_15 · Cited by 40
On the Security of Lattice-Based Fiat-Shamir Signatures in the Presence of Randomness Leakage
Liu, Y., Zhou, Y., Sun, S., Wang, T., Zhang, R., & Ming, J. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.3045904 · Cited by 39
Self-citationFaster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
Guo, Q., & Johansson, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_2 · Cited by 39
High-Speed Masking for Polynomial Comparison in Lattice-based KEMs
Bache, F., Paglialonga, C., Oder, T., Schneider, T., & Güneysu, T. E. (2020) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2020.i3.483-507 · Cited by 38
Report on the Security of LWE: Improved Dual Lattice Attack
MATZOV (2022) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.6412486 · Cited by 38
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor $$k^{1/(2k)}$$ Time $$k^{k/8+o(k)}$$
Albrecht, M. R., Bai, S., Fouque, P.-A., Kirchner, P., Stehlé, D., & Wen, W. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_7 · Cited by 37
Effective attack on the McEliece cryptosystem based on Reed-Muller codes
Borodin, M. A., & Chizhov, I. V. (2014) · Discrete Mathematics and Applications · doi:10.1515/dma-2014-0024 · Cited by 36
Higher-Order Masked Ciphertext Comparison for Lattice-Based Cryptography
D’Anvers, J.-P., Heinz, D., Pessl, P., Beirendonck, M. V., & Verbauwhede, I. M. R. (2022) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2022.i2.115-139 · Cited by 36
Recovering the Tight Security Proof of SPHINCS$$^+$$
Hülsing, A., & Kudinov, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22972-5_1 · Cited by 36
Breaking Masked and Shuffled CCA Secure Saber KEM by Power Analysis
Ngo, K., Dubrova, E., & Johansson, T. (2021) · Workshop on Attacks and Solutions in Hardware Security (ASHES) · doi:10.1145/3474376.3487277 · Cited by 35
High-order Polynomial Comparison and Masking Lattice-based Encryption
Coron, J.-S., Gérard, F., Montoya, S., & Zeitoun, R. (2022) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2023.i1.153-192 · Cited by 34
Improved Quantum Information Set Decoding
Kirshanova, E. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_24 · Cited by 33
McEliece Needs a Break – Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD
Esser, A., May, A., & Zweydinger, F. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07082-2_16 · Cited by 33
Second Order Statistical Behavior of LLL and BKZ
Yu, Y., & Ducas, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_1 · Cited by 31
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
Ducas, L., Plançon, M., & Wesolowski, B. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26948-7_12 · Cited by 31
A Power Side-Channel Attack on the CCA2-Secure HQC KEM
Schamberger, T., Renner, J., Sigl, G., & Wachter-Zeh, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-68487-7_8 · Cited by 31
Towards Verified, Constant-time Floating Point Operations
Andrysco, M., Nötzli, A., Brown, F., Jhala, R., & Stefan, D. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243766 · Cited by 30
Cited by
Abbasi, M., Cardoso, F., Váz, P., Silva, J., & Martins, P. (2025) · Cryptography · doi:10.3390/cryptography9020032 · Cited by 76
Quantum permutation pad for quantum secure symmetric and asymmetric cryptography
Kuang, R. (2025) · Academia Quantum · doi:10.20935/acadquant7457 · Cited by 4
Post-quantum XML and SAML Single Sign-On
Müller, J., & Oupický, J. (2024) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2024-0128 · Cited by 2
Segar, N., & Vijayan, V. (2026) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2026.1804943 · Cited by 5
Metadata
- Authors
- Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., Robinson, A., & Smith-Tone, D.
- Published
- 2022-07-05
- OpenAlex
- W4226075590
- Cited by
- 395
- References
- 259
- Type
- report
- Language
- en
- Open access
- gold
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.