Affiliation:
1. University of California Irvine, Irvine, California
2. University of Florida
3. ALaRi
4. Qualcomm Technologies Inc., San Diego, CA
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference185 articles.
1. Hamid Nejatollahi Nikil Dutt Sandip Ray Francesco Regazzoni Indranil Banerjee and Rosario Cammarota. 2017. Software and hardware implementation of lattice-cased cryptography schemes. University of California Irvine CECS TR 17-04 (2017). Hamid Nejatollahi Nikil Dutt Sandip Ray Francesco Regazzoni Indranil Banerjee and Rosario Cammarota. 2017. Software and hardware implementation of lattice-cased cryptography schemes. University of California Irvine CECS TR 17-04 (2017).
2. Peter W. Shor. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing (1997). 10.1137/S0097539795293172 Peter W. Shor. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing (1997). 10.1137/S0097539795293172
3. Gui-Lu Long. 2001. Grover algorithm with zero theoretical failure rate. Physical Review A (2001). Gui-Lu Long. 2001. Grover algorithm with zero theoretical failure rate. Physical Review A (2001).
4. Ali Ansarmohammadi Saeed Shahinfar and Hamid Nejatollahi. 2015. Fast and area efficient implementation for chaotic image encryption algorithms. In CADS. Ali Ansarmohammadi Saeed Shahinfar and Hamid Nejatollahi. 2015. Fast and area efficient implementation for chaotic image encryption algorithms. In CADS.
5. Ali Ansarmohammadi Hamid Nejatollahi and Ghasemi Mehdi. 2013. A low-cost implementation of AES accelerator using HW/SW co-design technique. In CADS. Ali Ansarmohammadi Hamid Nejatollahi and Ghasemi Mehdi. 2013. A low-cost implementation of AES accelerator using HW/SW co-design technique. In CADS.
Cited by
149 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献