The DOI matches its Crossref record; 130 of the 130 references it cites were found in a registry or an index.
Post-Quantum Lattice-Based Cryptography Implementations: A Survey
Abstract
The advent of quantum computing threatens to break many classical cryptographic schemes, leading to innovations in public key cryptography that focus on post-quantum cryptography primitives and protocols resistant to quantum computing threats. Lattice-based cryptography is a promising post-quantum cryptography family, both in terms of foundational properties as well as in its application to both traditional and emerging security problems such as encryption, digital signature, key exchange, and homomorphic encryption. While such techniques provide guarantees, in theory, their realization on contemporary computing platforms requires careful design choices and tradeoffs to manage both the diversity of computing platforms (e.g., high-performance to resource constrained), as well as the agility for deployment in the face of emerging and changing standards. In this work, we survey trends in lattice-based cryptographic schemes, some recent fundamental proposals for the use of lattices in computer security, challenges for their implementation in software and hardware, and emerging needs for their adoption. The survey means to be informative about the math to allow the reader to focus on the mechanics of the computation ultimately needed for mapping schemes on existing hardware or synthesizing part or all of a scheme on special-purpose har dware.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
A Note on the Generation of Random Normal Deviates
Box, G. E. P., & Muller, M. E. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706645 · Cited by 3,401
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
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 · cited 6×
“Ideal Lattices NTRU [89] NTRU Prime[115] Ring-Lizard (RLizard) [103, 104] trunc8 [116] HILA5 [66, 117] R.”
MethodInfluentialOn 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
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
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
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
Schnelle Multiplikation großer Zahlen
Schönhage, A., & Strassen, V. (1971) · Computing · doi:10.1007/bf02242355 · Cited by 1,107
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
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
Lattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
SHA-3 standard: permutation-based hash and extendable-output functions
National Institute of Standards and Technology (US) (2015) · doi:10.6028/nist.fips.202 · Cited by 783
Barrett, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_24 · 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
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
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
Classical hardness of learning with errors
Brakerski, Z., Langlois, A., Peikert, C., Regev, O., & Stehlé, D. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488680 · Cited by 627
The Ziggurat Method for Generating Random Variables
Marsaglia, G., & Tsang, W. W. (2000) · Journal of Statistical Software · doi:10.18637/jss.v005.i08 · Cited by 568
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
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
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
Fast Fourier Transforms: for fun and profit
Gentleman, W. M., & Sande, G. (1966) · Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall) · doi:10.1145/1464291.1464352 · Cited by 542
Post-quantum key exchange - a new hope.
Alkım, E., Ducas, L., Pöppelmann, T., & Schwabe, P. (2015) · Cited by 517
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
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
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
Grover algorithm with zero theoretical failure rate
Long, G. L. (2001) · Physical Review A · doi:10.1103/physreva.64.022307 · Cited by 458
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
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
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
An Efficient and Parallel Gaussian Sampler for Lattices
Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_5 · Cited by 372
Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_36 · Cited by 369
Lattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
How to Enhance the Security of Public-Key Encryption at Minimum Cost
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49162-7_5 · Cited by 342
Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem
Bos, J. W., Costello, C., Naehrig, M., & Stebila, D. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.40 · Cited by 329
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
On the Minimum Computation Time of Functions
Cook, S. A., & Aanderaa, S. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0249212-8 · Cited by 315
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
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
Longa, P., & Naehrig, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-48965-0_8 · Cited by 268
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
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
THE COMPLEXITY OF NONUNIFORM RANDOM NUMBER GENERATION.
Knuth, D. E., & Yao, A. C.-C. (1976) · Cited by 256
Compact Ring-LWE Cryptoprocessor
Roy, S. S., Vercauteren, F., Mentens, N., Chen, D. D., & Verbauwhede, I. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44709-3_21 · Cited by 255
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project
Stebila, D., & Mosca, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-69453-5_2 · Cited by 219
Fürer, M. (2009) · SIAM Journal on Computing · doi:10.1137/070711761 · Cited by 217
A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem.
Ding, J. (2012) · Cited by 215
Gaussian random number generators
Thomas, D. B., Luk, W., Leong, P. H. W., & Villasenor, J. D. (2007) · ACM Computing Surveys · doi:10.1145/1287620.1287622 · Cited by 213
Exponentiation cryptosystems on the IBM PC
Comba, P. G. (1990) · IBM Systems Journal · doi:10.1147/sj.294.0526 · Cited by 197
An Improved Compression Technique for Signatures Based on Learning with Errors
Bai, S., & Galbraith, S. D. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-04852-9_2 · Cited by 189
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
Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware
Pöppelmann, T., & Güneysu, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33481-8_8 · Cited by 167
Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
Pöppelmann, T., & Güneysu, T. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-43414-7_4 · Cited by 163
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
SHA-3 derived functions: cSHAKE, KMAC, TupleHash and ParallelHash
Kelsey, J. M., Change, S.-J., & Perlner, R. A. (2016) · doi:10.6028/nist.sp.800-185 · Cited by 154
On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
Göttert, N., Feller, T., Schneider, M., Buchmann, J. A., & Huss, S. A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33027-8_30 · Cited by 147
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Lyubashevsky, V., & Micciancio, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_34 · Cited by 147
High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_19 · Cited by 147
High-Speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems
Chen, D. D., Mentens, N., Vercauteren, F., Roy, S. S., Cheung, R. C. C., Pao, D. C. W., & Verbauwhede, I. M. R. (2014) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2014.2350431 · Cited by 137
Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling: Extended Abstract
Aggarwal, D., Dadush, D., Regev, O., & Stephens-Davidowitz, N. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746606 · Cited by 126
Dent, A. W. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40974-8_12 · Cited by 125
Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
Dwarakanath, N. C., & Galbraith⋆, S. D. (2014) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-014-0218-3 · Cited by 121
Enhanced Lattice-Based Signatures on Reconfigurable Hardware
Pöppelmann, T., Ducas, L., & Güneysu, T. E. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44709-3_20 · Cited by 119
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time
Micciancio, D., & Walter, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0_16 · Cited by 116
High-Performance and Lightweight Lattice-Based Public-Key Encryption
Buchmann, J. A., Göpfert, F., Güneysu, T. E., Oder, T., & Pöppelmann, T. (2016) · doi:10.1145/2899007.2899011 · Cited by 105
Fast polynomial transform algorithms for digital convolution
Nussbaumer, H. (1980) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1980.1163372 · Cited by 104
Efficient Software Implementation of Ring-LWE Encryption
de Clercq, R., Roy, S. S., Vercauteren, F., & Verbauwhede, I. M. R. (2015) · Design, Automation, and Test in Europe · doi:10.7873/date.2015.0378 · Cited by 103
Bai, S., Roux-Langlois, A., Lepoint, T., Stehlé, D., & Steinfeld, R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6_1 · Cited by 102
High-Speed Key Encapsulation from NTRU
Hülsing, A., Rijneveld, J., Schanck, J. M., & Schwabe, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66787-4_12 · Cited by 99
On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
Howe, J., Khalid, A., Rafferty, C., Regazzoni, F., & O'Neill, M. P. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2016.2642962 · Cited by 95
Self-citationChoosing Parameters for NTRUEncrypt
Hoffstein, J., Pipher, J. C., Schanck, J. M., Silverman, J. H., Whyte, W., & Zhang, Z. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-52153-4_1 · Cited by 95
Efficient Ring-LWE Encryption on 8-Bit AVR Processors
Liu, Z., Seo, H., Roy, S. S., Großschädl, J., Kim, H., & Verbauwhede, I. M. R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48324-4_33 · Cited by 94
Physical Layer Group Key Agreement for Automotive Controller Area Networks
Jain, S., & Guajardo, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53140-2_5 · Cited by 90
Fast Fourier Orthogonalization
Ducas, L., & Prest, T. (2016) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2930889.2930923 · Cited by 89
Area optimization of lightweight lattice-based encryption on reconfigurable hardware
Pöppelmann, T., & Güneysu, T. E. (2014) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2014.6865754 · Cited by 87
Low-cost and area-efficient FPGA implementations of lattice-based cryptography
Aysu, A., Patterson, C., & Schaumont, P. R. (2013) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/hst.2013.6581570 · Cited by 87
High Precision Discrete Gaussian Sampling on FPGAs
Roy, S. S., Vercauteren, F., & Verbauwhede, I. M. R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_19 · Cited by 83
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_26 · Cited by 78
NewHope without reconciliation.Preprint
Alkım, E., Ducas, L., Pöppelmann, T., & Schwabe, P. (2016) · IACR Cryptology ePrint Archive · Cited by 76
Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR
Cheon, J. H., Kim, D., Lee, J., & Song, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_9 · Cited by 76
Evaluation of Large Integer Multiplication Methods on Hardware
Rafferty, C., O'Neill, M. P., & Hanley, N. (2017) · IEEE Transactions on Computers · doi:10.1109/tc.2017.2677426 · Cited by 65
Revisiting TESLA in the Quantum Random Oracle Model
Alkım, E., Bindel, N., Buchmann, J. A., Dagdelen, Ö., Eaton, E., Gutoski, G., Krämer, J., & Pawlega, F. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_9 · Cited by 64
Improvement and Efficient Implementation of a Lattice-Based Signature Scheme
Bansarkhani, R. E., & Buchmann, J. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43414-7_3 · Cited by 60
Software Speed Records for Lattice-Based Signatures
Güneysu, T. E., Oder, T., Pöppelmann, T., & Schwabe, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_5 · Cited by 60
Practical Lattice-Based Digital Signature Schemes
Howe, J., Pöppelmann, T., O'Neill, M. P., O’Sullivan, E., & Güneysu, T. E. (2015) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2724713 · Cited by 59
An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation
Akleylek, S., Bindel, N., Buchmann, J. A., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31517-1_3 · Cited by 58
NAEP: Provable Security in the Presence of Decryption Failures.
Howgrave-Graham, N., Silverman, J. H., Singer, A., & Whyte, W. (2003) · Cited by 58
Middle-Product Learning with Errors
Roşca, M., Sakzad, A., Stehlé, D., & Steinfeld, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63697-9_10 · Cited by 57
Implementing the NewHope-Simple Key Exchange on Low-Cost FPGAs
Oder, T., & Güneysu, T. E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25283-0_7 · Cited by 55
Oder, T., Pöppelmann, T., & Güneysu, T. E. (2014) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2593069.2593098 · Cited by 53
Boorghany, A., Bayat-Sarmadi, S., & Jalili, R. (2015) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2700078 · Cited by 51
Hardware Complexity of Modular Multiplication and Exponentiation
David, J., Kalach, K., & Tittley, N. (2007) · IEEE Transactions on Computers · doi:10.1109/tc.2007.1084 · Cited by 45
Saarinen, M.-J. O. (2017) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0149-6 · Cited by 45
Alkım, E., Jakubeit, P., & Schwabe, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49445-6_19 · Cited by 41
Boorghany, A., & Jalili, R. (2014) · IACR Cryptology ePrint Archive · Cited by 33
Reparaz, O., Roy, S. S., de Clercq, R., Vercauteren, F., & Verbauwhede, I. M. R. (2016) · Journal of Cryptographic Engineering · doi:10.1007/s13389-016-0126-5 · Cited by 32
Speeding up R-LWE Post-quantum Key Exchange
Gueron, S., & Schlieker, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-47560-8_12 · Cited by 32
High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers
Liu, Z., Pöppelmann, T., Oder, T., Seo, H., Roy, S. S., Güneysu, T. E., Großschädl, J., Kim, H., & Verbauwhede, I. M. R. (2017) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3092951 · Cited by 30
Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
Streit, S., & Santis, F. D. (2017) · IEEE Transactions on Computers · doi:10.1109/tc.2017.2773524 · Cited by 29
HILA5: On Reliability, Reconciliation, and Error Correction for Ring-LWE Encryption
Saarinen, M.-J. O. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_10 · Cited by 28
High-Speed Signatures from Standard Lattices
Dagdelen, Ö., Bansarkhani, R. E., Göpfert, F., Güneysu, T. E., Oder, T., Pöppelmann, T., Sánchez, A. H., & Schwabe, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16295-9_5 · Cited by 25
Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
Chen, D. D., Yao, G. X., Cheung, R. C. C., Pao, D. C. W., & Koç, Ç. K. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2417553 · Cited by 25
Efficient Multiplication of Polynomials on Graphics Hardware
Emeliyanenko, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03644-6_11 · Cited by 24
Lower Bounds on Lattice Enumeration with Extreme Pruning
Aono, Y., Nguyễn, P. Q., Seito, T., & Shikata, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96881-0_21 · Cited by 24
Sharper Ring-LWE Signatures.Preprint
Barreto, P. S. L. M., Longa, P., Naehrig, M., Ricardini, J. E., & Zanon, G. H. M. (2016) · IACR Cryptology ePrint Archive · Cited by 24
Transcript Secure Signatures Based on Modular Lattices
Hoffstein, J., Pipher, J. C., Schanck, J. M., Silverman, J. H., & Whyte, W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_9 · Cited by 21
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
Güneysu, T. E., Lyubashevsky, V., & Pöppelmann, T. (2014) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2346177 · Cited by 21
High-Speed Polynomial Multiplier Architecture for Ring-LWE Based Public Key Cryptosystems
Du, C., Bai, G., & Wu, X. (2016) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/2902961.2902969 · Cited by 21
Trends, challenges and needs for lattice-based cryptography implementations
Nejatollahi, H., Dutt, N. D., & Cammarota, R. (2017) · doi:10.1145/3125502.3125559 · Cited by 19
Self-citationLattice-based cryptography: From reconfigurable hardware to ASIC
Oder, T., Güneysu, T. E., Valencia, F. A., Khalid, A., O'Neill, M. P., & Regazzoni, F. (2016) · International Symposium on Integrated Circuits · doi:10.1109/isicir.2016.7829689 · Cited by 16
Self-citationInteger Version of Ring-LWE and Its Applications
Gu, C. (2019) · Communications in computer and information science · doi:10.1007/978-981-15-0758-8_9 · Cited by 16
Lizard: Cut off the Tail! // Practical Post-Quantum Public-Key Encryption from LWE and LWR.Preprint
Cheon, J. H., Kim, D., Lee, J., & Song, Y. (2016) · IACR Cryptology ePrint Archive · Cited by 16
Cryptographic Functions from Worst-Case Complexity Assumptions
Micciancio, D. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_13 · Cited by 15
Saarinen, M.-J. O. (2017) · doi:10.1145/3055245.3055254 · Cited by 15
Compact and provably secure lattice-based signatures in hardware
Howe, J., Rafferty, C., Khalid, A., & O'Neill, M. P. (2017) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2017.8050566 · Cited by 14
Efficient polynomial multiplier architecture for Ring-LWE based public key cryptosystems
Du, C., & Bai, G. (2016) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2016.7527452 · Cited by 13
Sparse polynomial multiplication for lattice-based cryptography with small complexity
Akleylek, S., Alkım, E., & Tok, Z. Y. (2015) · The Journal of Supercomputing · doi:10.1007/s11227-015-1570-1 · Cited by 12
A signature scheme from Learning with Truncation.Preprint
Hoffstein, J., Pipher, J. C., Whyte, W., & Zhang, Z. (2017) · IACR Cryptology ePrint Archive · Cited by 12
Portable Implementation of Lattice-Based Cryptography Using JavaScript
Yuan, Y., Cheng, C.-M., Kiyomoto, S., Miyake, Y., & Takagi, T. (2015) · International Symposium on Computing and Networking · doi:10.1109/candar.2015.36 · Cited by 10
Precomputation Methods for Hash-Based Signatures on Energy-Harvesting Platforms
Aysu, A., & Schaumont, P. R. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2500570 · Cited by 9
Fast and area efficient implementation for chaotic image encryption algorithms
Ansarmohammadi, S. A., Shahinfar, S., & Nejatollahi, H. (2015) · CSI International Symposium on Computer Architecture and Digital Systems (CADS) · doi:10.1109/cads.2015.7377788 · Cited by 8
Self-citationLARA: A Design Concept for Lattice-Based Encryption
Bansarkhani, R. E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-32101-7_23 · Cited by 5
Cited by
The 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
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
Quantum computing for healthcare: a review
Ur Rasool, R., Ahmad, H. F., Rafique, W., Qayyum, A., Qadir, J., & Anwar, Z. (2023) · Future Internet · doi:10.3390/fi15030094 · Cited by 242
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
Post-quantum Cryptography: A Solution to the Challenges of Classical Encryption Algorithms
Sharma, S., Ramkumar, K. R., Kaur, A., Hasija, T., Mittal, S., & Singh, B. (2023) · Lecture Notes in Electrical Engineering · doi:10.1007/978-981-19-6383-4_3 · Cited by 36
Metadata
- Authors
- Nejatollahi, H., Dutt, N., Ray, S., Regazzoni, F., Banerjee, I., & Cammarota, R.
- Venue
- ACM Computing Surveys
- Published
- 2019-01-28
- Volume
- 51
- Issue
- 6
- Pages
- 1-41
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2914654142
- Cited by
- 277
- References
- 130
- FWCI
- 10.25
- Type
- journal article
- Language
- en
- Open access
- closed
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.