research-article

Practical Lattice-Based Digital Signature Schemes

Authors:

Thomas Pöppelmann,

Máire O'neill,

Elizabeth O'sullivan,

Tim GüneysuAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 14, Issue 3

Article No.: 41, Pages 1 - 24

https://doi.org/10.1145/2724713

Published: 21 April 2015 Publication History

Abstract

Digital signatures are an important primitive for building secure systems and are used in most real-world security protocols. However, almost all popular signature schemes are either based on the factoring assumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case of classical cryptanalytic advances or progress on the development of quantum computers, the hardness of these closely related problems might be seriously weakened. A potential alternative approach is the construction of signature schemes based on the hardness of certain lattice problems that are assumed to be intractable by quantum computers. Due to significant research advancements in recent years, lattice-based schemes have now become practical and appear to be a very viable alternative to number-theoretic cryptography. In this article, we focus on recent developments and the current state of the art in lattice-based digital signatures and provide a comprehensive survey discussing signature schemes with respect to practicality. Additionally, we discuss future research areas that are essential for the continued development of lattice-based cryptography.

References

[1]

Michel Abdalla, Jee Hea An, Mihir Bellare, and Chanathip Namprempre. 2002. From identification to signatures via the fiat-shamir transform: Minimizing assumptions for security and forward-security. In EUROCRYPT. 418--433.

Digital Library

[2]

Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, and Mehdi Tibouchi. 2012. Tightly-secure signatures from lossy identification schemes. In EUROCRYPT. 572--590.

Digital Library

[3]

Shweta Agrawal, Dan Boneh, and Xavier Boyen. 2010. Efficient lattice (H)IBE in the standard model. In EUROCRYPT. 553--572.

Digital Library

[4]

Miklós Ajtai. 1996. Generating hard instances of lattice problems (extended abstract). In STOC. 99--108.

Digital Library

[5]

Miklós Ajtai, Ravi Kumar, and D. Sivakumar. 2001. A sieve algorithm for the shortest lattice vector problem. In STOC. 601--610.

Digital Library

[6]

Joël Alwen and Chris Peikert. 2011. Generating shorter bases for hard random lattices. Theory Comput. Syst. 48, 3 (2011), 535--553.

Digital Library

[7]

Aydin Aysu, Cameron Patterson, and Patrick Schaumont. 2013. Low-cost and area-efficient FPGA implementations of lattice-based cryptography. In HOST. 81--86.

[8]

Shi Bai and Steven D. Galbraith. 2014. An improved compression technique for signatures based on learning with errors. In CT-RSA. 28--47.

[9]

Rachid El Bansarkhani and Johannes Buchmann. 2013. Improvement and efficient implementation of a lattice-based signature scheme. In Selected Areas in Cryptography. 48--67.

[10]

Mihir Bellare and Phillip Rogaway. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS. 62--73.

Digital Library

[11]

Richard E. Blahut. 2010. Fast Algorithms for Signal Processing. Cambridge University Press.

[12]

Dan Boneh, Amit Sahai, and Brent Waters. 2011. Functional encryption: Definitions and challenges. In TCC. Vol. 6597.

Digital Library

[13]

Dan Boneh and Mark Zhandry. 2013. Secure signatures and chosen ciphertext security in a quantum computing world. In CRYPTO (2). 361--379.

[14]

Ahmad Boorghany and Rasool Jalili. 2014. Implementation and comparison of lattice-based identification protocols on smart cards and microcontrollers. IACR Cryptology ePrint Archive 2014 (2014), 78.

[15]

Ahmad Boorghany, Siavash Bayat Sarmadi, and Rasool Jalili. 2014. On constrained implementation of lattice-based cryptographic primitives and schemes on smart cards. IACR Cryptology ePrint Archive 2014 (2014), 514.

[16]

Xavier Boyen. 2010. Lattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more. In PKC. 499--517.

Digital Library

[17]

Xavier Boyen. 2013. Attribute-based functional encryption on lattices. In TCC. 122--142.

Digital Library

[18]

Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehlé. 2013. Classical hardness of learning with errors. In STOC. 575--584.

Digital Library

[19]

Johannes Buchmann, Daniel Cabarcas, Florian Göpfert, Andreas Hülsing, and Patrick Weiden. 2013. Discrete ziggurat: A time-memory trade-off for sampling from a gaussian distribution over the integers. In Selected Areas in Cryptography. Springer, 402--417.

[20]

Johannes Buchmann, Richard Lindner, Markus Rückert, and Michael Schneider. 2009. Post-quantum cryptography: lattice signatures. Computing 85, 1--2 (2009), 105--125.

Digital Library

[21]

Jan Camenisch, Gregory Neven, and Markus Rückert. 2012. Fully anonymous attribute tokens from lattices. In SCN. 57--75.

Digital Library

[22]

Donald Donglong Chen, Nele Mentens, Frederik Vercauteren, Sujoy Sinha Roy, Ray C. C. Cheung, Derek Pao, and Ingrid Verbauwhede. 2014. High-speed polynomial multiplication architecture for ring-LWE and SHE cryptosystems. IACR Cryptology ePrint Archive 2014 (2014), 646.

[23]

Lo Sing Cheng, Ali Miri, and Tet Hin Yeap. 2005. Efficient FPGA implementation of FFT based multipliers. In Electrical and Computer Engineering, 2005. 1300--1303.

[24]

Ruan de Clercq, Sujoy Sinha Roy, Frederik Vercauteren, and Ingrid Verbauwhede. 2014. Efficient software implementation of ring-LWE encryption. IACR Cryptology ePrint Archive 2014 (2014), 725.

[25]

James Cooley and John Tukey. 1965. An algorithm for the machine calculation of complex fourier series. Math. Comp. 19, 90 (1965), 297--301.

[26]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press.

Digital Library

[27]

Özgür Dagdelen, Marc Fischlin, and Tommaso Gagliardoni. 2013. The Fiat-Shamir transformation in a quantum world. In ASIACRYPT (2). 62--81.

[28]

Whitfield Diffie and Martin E. Hellman. 1976. New directions in cryptography. IEEE Trans. Inform. Theory 22, 6 (1976), 644--654.

Digital Library

[29]

Irit Dinur, Guy Kindler, Ran Raz, and Shmuel Safra. 2003. Approximating CVP to within almost-polynomial factors is NP-Hard. Combinatorica 23, 2 (April 2003), 205--243.

Digital Library

[30]

Benedikt Driessen, Axel Poschmann, and Christof Paar. 2008. Comparison of innovative signature algorithms for WSNs. In WISEC. 30--35.

Digital Library

[31]

Léo Ducas. 2014. Accelerating Bliss: The geometry of ternary polynomials. IACR Cryptology ePrint Archive 2014 (2014), 874.

[32]

Léo Ducas, Alain Durmus, Tancrède Lepoint, and Vadim Lyubashevsky. 2013. Lattice signatures and bimodal Gaussians. In CRYPTO (1). 40--56. Retrieved from https://eprint.iacr.org/2013/383.pdf.

[33]

Léo Ducas, Vadim Lyubashevsky, and Thomas Prest. 2014. Efficient identity-based encryption over NTRU lattices. In ASIACRYPT. 22--41.

[34]

Léo Ducas and Daniele Micciancio. 2014. Improved short lattice signatures in the standard model. In CRYPTO. 335--352.

[35]

Léo Ducas and Phong Q. Nguyen. 2012a. Faster gaussian lattice sampling using lazy floating-point arithmetic. In ASIACRYPT. 415--432.

Digital Library

[36]

Léo Ducas and Phong Q. Nguyen. 2012b. Learning a zonotope and more: Cryptanalysis of NTRUSign countermeasures. In ASIACRYPT. 433--450.

Digital Library

[37]

Nagarjun C. Dwarakanath and Steven D. Galbraith. 2014. Sampling from discrete Gaussians for lattice-based cryptography on a constrained device. Appl. Algebra Eng. Commun. Comput. 25, 3 (2014), 159--180.

Digital Library

[38]

Pavel Emeliyanenko. 2009. Efficient multiplication of polynomials on graphics hardware. In APPT. 134--149.

Digital Library

[39]

Amos Fiat and Adi Shamir. 1986. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO. 186--194.

Digital Library

[40]

Steven D. Galbraith. 2012. Mathematics of Public-Key Cryptography. Cambridge University Press. xiv, 452--459.

Digital Library

[41]

Craig Gentry. 2009a. A Fully Homomorphic Encryption Scheme. Ph.D. Dissertation. Stanford University.

Digital Library

[42]

Craig Gentry. 2009b. Fully homomorphic encryption using ideal lattices. In STOC. 169--178.

Digital Library

[43]

Craig Gentry, Jakob Jonsson, Jacques Stern, and Michael Szydlo. 2001. Cryptanalysis of the NTRU signature scheme (NSS). In ASIACRYPT. 1--20.

Digital Library

[44]

Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. 2008. Trapdoors for hard lattices and new cryptographic constructions. In STOC. 197--206.

Digital Library

[45]

Craig Gentry and Michael Szydlo. 2002. Cryptanalysis of the revised NTRU signature scheme. In EUROCRYPT. 299--320.

Digital Library

[46]

Oded Goldreich, Shafi Goldwasser, and Shai Halevi. 1996. Public-key cryptosystems from lattice reduction problems. Electron. Colloquium Comput. Complexity (ECCC) 3, 56 (1996).

[47]

Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. 1988. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17, 2 (April 1988), 281--308.

Digital Library

[48]

Samuel Dov Gordon, Jonathan Katz, and Vinod Vaikuntanathan. 2010. A group signature scheme from lattice assumptions. In ASIACRYPT. 395--412.

[49]

Norman Göttert, Thomas Feller, Michael Schneider, Johannes Buchmann, and Sorin A. Huss. 2012. On the design of hardware building blocks for modern lattice-based encryption schemes. In CHES. 512--529.

Digital Library

[50]

Tim Güneysu, Vadim Lyubashevsky, and Thomas Pöppelmann. 2012. Practical lattice-based cryptography: A signature scheme for embedded systems. In CHES. 530--547.

Digital Library

[51]

Tim Güneysu, Tobias Oder, Thomas Pöppelmann, and Peter Schwabe. 2013. Software speed records for lattice-based signatures. In PQCrypto. 67--82.

[52]

Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eberle, and Sheueling Chang Shantz. 2004. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In CHES. 119--132.

[53]

Tamas Györfi, Octavian Cret, and Zalan Borsos. 2013. Implementing modular FFTs in FPGAs - A basic block for lattice-based cryptography. In DSD. 305--308.

Digital Library

[54]

Bettina Helfrich. 1985. Algorithms to construct Minkowski reduced and hermite reduced lattice bases. Theor. Comput. Sci. 41, 2--3 (Dec. 1985), 125--139.

Digital Library

[55]

Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, and William Whyte. 2003. NTRUSign: Digital signatures using the NTRU lattice. In CT-RSA. 122--140.

Digital Library

[56]

Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A ring-based public key cryptosystem. In ANTS. 267--288.

Digital Library

[57]

Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. 2001. NSS: An NTRU lattice-based signature scheme. In EUROCRYPT. 211--228.

Digital Library

[58]

Abdel Alim Kamal and Amr M. Youssef. 2009. An FPGA implementation of the NTRUEncrypt cryptosystem. In ICM. 209--212.

[59]

Anatoly A. Karatsuba and Yuri Petrovich Ofman. 1963. Multiplication of multidigit numbers on automata. Soviet Phys. Doklady 7 (1963), 595--596.

[60]

Neal Koblitz. 1987. Elliptic curve cryptosystems. Math. Comp. 48, 177 (1987), 203--209.

Digital Library

[61]

Paul C. Kocher, Joshua Jaffe, and Benjamin Jun. 1999. Differential power analysis. In CRYPTO. 388--397.

Digital Library

[62]

Fabien Laguillaumie, Adeline Langlois, Benoît Libert, and Damien Stehlé. 2013. Lattice-based group signatures with logarithmic signature size. In ASIACRYPT (2). 41--61.

[63]

Adeline Langlois and Damien Stehlé. 2014. Worst-case to average-case reductions for module lattices. Designs, Codes Cryptogr. (2014), 1--35.

Digital Library

[64]

Richard Lindner and Chris Peikert. 2011. Better key sizes (and attacks) for LWE-based encryption. In CT-RSA. 319--339.

Digital Library

[65]

Vadim Lyubashevsky. 2009. Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In ASIACRYPT. 598--616.

Digital Library

[66]

Vadim Lyubashevsky. 2012. Lattice signatures without trapdoors. In EUROCRYPT. 738--755.

Digital Library

[67]

Vadim Lyubashevsky and Daniele Micciancio. 2009. On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In CRYPTO. 577--594.

Digital Library

[68]

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen. 2008. SWIFFT: A modest proposal for FFT hashing. In FSE. 54--72.

[69]

Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On ideal lattices and learning with errors over rings. In EUROCRYPT. 1--23.

Digital Library

[70]

Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2013a. On ideal lattices and learning with errors over rings. J. ACM 60, 6 (2013), 43.

Digital Library

[71]

Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2013b. A toolkit for ring-LWE cryptography. In EUROCRYPT. 35--54.

[72]

James H. McClellan. 1976. Hardware realization of a Fermat number transform. IEEE Trans. Acoustics, Speech Signal Proc. 24, 3 (June 1976), 216--225.

[73]

Carlos Aguilar Melchor, Xavier Boyen, Jean-Christophe Deneuville, and Philippe Gaborit. 2014. Sealing the leak on classical NTRU signatures. In PQCrypto 2014. 1--21.

[74]

Daniele Micciancio. 2007. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16, 4 (Dec. 2007), 365--411.

Digital Library

[75]

Daniele Micciancio. 2008. Efficient reductions among lattice problems. In SODA. 84--93.

Digital Library

[76]

Daniele Micciancio and Petros Mol. 2011. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. In CRYPTO. 465--484.

Digital Library

[77]

Daniele Micciancio and Chris Peikert. 2012. Trapdoors for lattices: Simpler, tighter, faster, smaller. In EUROCRYPT. 700--718.

Digital Library

[78]

Daniele Micciancio and Chris Peikert. 2013. Hardness of SIS and LWE with small parameters. In CRYPTO (1). 21--39.

[79]

Daniele Micciancio and Oded Regev. 2004. Worst-case to average-case reductions based on Gaussian measures. In FOCS. 372--381.

Digital Library

[80]

Daniele Micciancio and Oded Regev. 2007. Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37, 1 (2007), 267--302.

Digital Library

[81]

Victor S. Miller. 1986. Use of elliptic curves in cryptography. In CRYPTO. 417--426.

Digital Library

[82]

Robert T. Moenck. 1976. Practical fast polynomial multiplication. In SYMSACC. 136--148.

Digital Library

[83]

Phong Q. Nguyen and Oded Regev. 2009. Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures. J. Cryptol. 22, 2 (2009), 139--160.

Digital Library

[84]

Henri Nussbaumer. 1980. Fast Fourier Transform and Convolution Algorithms. Springer-Verlag.

[85]

Tobias Oder, Thomas Pöppelmann, and Tim Güneysu. 2014. Beyond ECDSA and RSA: Lattice-based digital signatures on constrained devices. In DAC. 1--6.

Digital Library

[86]

Marshall C. Pease. 1968. An adaptation of the fast fourier transform for parallel processing. J. ACM 15, 2 (April 1968), 252--264.

Digital Library

[87]

Chris Peikert. 2008. Public-key cryptosystems from the worst-case shortest vector problem. Electron. Colloquium Comput. Complexity (ECCC) 15, 100 (2008).

[88]

Chris Peikert. 2010. An efficient and parallel gaussian sampler for lattices. In CRYPTO. 80--97.

Digital Library

[89]

John M. Pollard. 1971. The fast fourier transform in a finite field. Math. Comp. 25, 114 (1971), 365--374.

[90]

Thomas Pöppelmann, Léo Ducas, and Tim Güneysu. 2014. Enhanced lattice-based signatures on reconfigurable hardware. In CHES. 353--370. Retrieved from https://eprint.iacr.org/2014/254.pdf.

Digital Library

[91]

Thomas Pöppelmann and Tim Güneysu. 2012. Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware. In LATINCRYPT. 139--158.

Digital Library

[92]

Thomas Pöppelmann and Tim Güneysu. 2013. Towards practical lattice-based public-key encryption on reconfigurable hardware. In Selected Areas in Cryptography. Springer, 68--85.

[93]

Thomas Pöppelmann and Tim Güneysu. 2014. Area optimization of lightweight lattice-based encryption on reconfigurable hardware. In ISCAS. 2796--2799.

[94]

Oded Regev. 2005. On lattices, learning with errors, random linear codes, and cryptography. In STOC. 84--93.

Digital Library

[95]

Oded Regev. 2009. On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56, 6 (2009), 40.

Digital Library

[96]

Sujoy Sinha Roy, Oscar Reparaz, Frederik Vercauteren, and Ingrid Verbauwhede. 2014. Compact and side channel secure discrete gaussian sampling. IACR Cryptology ePrint Archive 2014 (2014), 591.

[97]

Sujoy Sinha Roy, Frederik Vercauteren, Nele Mentens, Donald Donglong Chen, and Ingrid Verbauwhede. 2014. Compact hardware implementation of ring-LWE cryptosystems. In CHES. 371--391.

[98]

Sujoy Sinha Roy, Frederik Vercauteren, and Ingrid Verbauwhede. 2013. High precision discrete Gaussian sampling on FPGAs. In Selected Areas in Cryptography. Springer, 1--39.

[99]

Markus Rückert and Michael Schneider. 2010. Estimating the security of lattice-based cryptosystems. IACR Cryptology ePrint Archive 2010 (2010), 137.

[100]

Claus-Peter Schnorr. 1989. Efficient identification and signatures for smart cards. In CRYPTO. 239--252.

Digital Library

[101]

Peter W. Shor. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5 (Oct. 1997), 1484--1509.

Digital Library

[102]

Patrick Weiden, Andreas Hülsing, Daniel Cabarcas, and Johannes Buchmann. 2013. Instantiating treeless signature schemes. IACR Cryptology ePrint Archive 2013 (2013), 65.

[103]

Franz Winkler. 1996. Polynomial Algorithms in Computer Algebra (Texts and Monographs in Symbolic Computation). Springer.

Digital Library

Cited By

Premila TJanaki NGovindasamy PGanesh E(2024)Cryptography using the Internet of ThingsIntelligent Technologies for Automated Electronic Systems10.2174/9789815179514124010016(167-181)Online publication date: 4-Mar-2024
https://doi.org/10.2174/9789815179514124010016
M P SEbenezer V(2024)Fortifying Blockchain: Streamlined Lattice Signatures Amid Quantum Threats to Blockchain2024 5th International Conference on Mobile Computing and Sustainable Informatics (ICMCSI)10.1109/ICMCSI61536.2024.00106(677-682)Online publication date: 18-Jan-2024
https://doi.org/10.1109/ICMCSI61536.2024.00106
Biswas SGoswami RHemant Kumar Reddy KMohanty SAhmed M(2024)Exploring the fusion of lattice‐based quantum key distribution for secure Internet of Things communicationsIET Quantum Communication10.1049/qtc2.121055:4(322-339)Online publication date: 29-Dec-2024
https://dl.acm.org/doi/10.1049/qtc2.12105
Show More Cited By

Index Terms

Practical Lattice-Based Digital Signature Schemes

Recommendations

Quantum-Access Security of Hash-Based Signature Schemes
Information Security and Privacy
Abstract
In post-quantum cryptography, hash-based signature schemes are attractive choices because of the weak assumptions. Most existing hash-based signature schemes are proven secure against post-quantum chosen message attacks (CMAs), where the ...
New multi-proxy multi-signature schemes

A new kind of proxy signature schemes is first proposed: multi-proxy multi-signature schemes. In multi-proxy multi-signature schemes, an original group of signers can authorize a group of proxy signers under the agreement of all singers both in the ...
Lattice-based certificateless encryption scheme

Certificateless public key cryptography (CL-PKC) can solve the problems of certificate management in a public key infrastructure (PKI) and of key escrows in identity-based public key cryptography (ID-PKC). In CL-PKC, the key generation center (KGC) does ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 14, Issue 3

Special Issue on Embedded Platforms for Crypto and Regular Papers

May 2015

515 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2764962

Editor:
Sandeep K. Shukla
Virginia Tech, USA

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 21 April 2015

Accepted: 01 January 2015

Revised: 01 October 2014

Received: 01 July 2014

Published in TECS Volume 14, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

DFG Research Training Group GRK 1817/1
the German Research Foundation (DFG)
European Union H2020 SAFEcrypto project

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
1,259
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)8

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Premila TJanaki NGovindasamy PGanesh E(2024)Cryptography using the Internet of ThingsIntelligent Technologies for Automated Electronic Systems10.2174/9789815179514124010016(167-181)Online publication date: 4-Mar-2024
https://doi.org/10.2174/9789815179514124010016
M P SEbenezer V(2024)Fortifying Blockchain: Streamlined Lattice Signatures Amid Quantum Threats to Blockchain2024 5th International Conference on Mobile Computing and Sustainable Informatics (ICMCSI)10.1109/ICMCSI61536.2024.00106(677-682)Online publication date: 18-Jan-2024
https://doi.org/10.1109/ICMCSI61536.2024.00106
Biswas SGoswami RHemant Kumar Reddy KMohanty SAhmed M(2024)Exploring the fusion of lattice‐based quantum key distribution for secure Internet of Things communicationsIET Quantum Communication10.1049/qtc2.121055:4(322-339)Online publication date: 29-Dec-2024
https://dl.acm.org/doi/10.1049/qtc2.12105
Haidary Makoui FGulliver TDakhilalian M(2023)A new code‐based digital signature based on the McEliece cryptosystemIET Communications10.1049/cmu2.1260717:10(1199-1207)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1049/cmu2.12607
Sun MWang SChen HQu L(2023)A New Random Sampling Method and Its Application in Improving Progressive BKZ AlgorithmJournal of Systems Science and Complexity10.1007/s11424-023-3107-737:5(2262-2292)Online publication date: 25-Oct-2023
https://doi.org/10.1007/s11424-023-3107-7
Kundi DZhang YWang CKhalid AONeill MLiu W(2022)Ultra High-Speed Polynomial Multiplications for Lattice-Based Cryptography on FPGAsIEEE Transactions on Emerging Topics in Computing10.1109/TETC.2022.314410110:4(1993-2005)Online publication date: 1-Oct-2022
https://doi.org/10.1109/TETC.2022.3144101
Wu FLi B(2022)Lightweight Lattice-Based Signature for VANET2022 IEEE 7th International Conference on Intelligent Transportation Engineering (ICITE)10.1109/ICITE56321.2022.10101468(406-411)Online publication date: 11-Nov-2022
https://doi.org/10.1109/ICITE56321.2022.10101468
Asif R(2021)Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based AlgorithmsIoT10.3390/iot20100052:1(71-91)Online publication date: 5-Feb-2021
https://doi.org/10.3390/iot2010005
Esseissah MBhery ADaoud SBahig H(2021)Three Strategies for Improving Shortest Vector Enumeration Using GPUsScientific Programming10.1155/2021/88524972021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/8852497
Ravi PHowe JChattopadhyay ABhasin S(2021)Lattice-based Key-sharing SchemesACM Computing Surveys10.1145/342217854:1(1-39)Online publication date: 2-Jan-2021
https://dl.acm.org/doi/10.1145/3422178
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents