期刊文献+

面向格基密码体制的高效硬件实现研究综述 被引量:8

A Survey on High-Efficiency Hardware Implementation for Lattice-Based Cryptosystem
下载PDF
导出
摘要 格基密码体制以其强大的安全性、高效性、灵活性、实用性等特点从众多后量子密码体制方案中脱颖而出.在实际应用中,可将格基密码体制的自身优势与硬件构架的并行性、灵活性等特点充分结合,使整个系统能够高效运行.本文简要介绍了格的基本概念以及格上的困难问题;探讨了格基密码体制的主要优势以及其在公钥加密、数字签名、密钥交换等方面的应用价值;在硬件实现格基密码的模块设计架构中,针对离散高斯采样器、多项式乘法器这两大主要模块的主流优化技术和实现方法进行了调研、总结和比较;在硬件实现格基密码的整体架构中,围绕格基密码在不同场景下的应用、不同的硬件优化目的(面向性能/面向资源)等方面,详细分析对比了当前先进的设计理念和优化技术;最后,从安全性、灵活性、资源消耗、吞吐量等角度,将格基密码体制在硬件上的实现情况与其它实现方法进行对比分析,充分展现其在实际应用中的高效性和实用性. Lattice-based cryptosystems stand out from many post-quantum cryptosystems due to their feature of strong security,high efficiency,high flexibility and practicability.In practical applications,the advantages of the lattice-based cryptosystems fit perfectly to the parallelism and flexibility of the hardware architecture,therefore the entire system can run efficiently.This paper briefly introduces the basic concepts of lattice and some difficult problems of lattice,discusses the main advantages of lattice cryptosystems and their applications in public key encryption,digital signature,key exchange,etc.In hardware module design architecture,this paper presents some summaries and comparisons featuring the mainstream optimization techniques and implementation methods of two main modules,namely Discrete Gaussian Sampler and Polynomial Multiplier.In the overall architecture design of hardware-implemented lattice-based cryptosystem,some outstanding designing concepts and optimization techniques are discussed in detail.Considering different purposes of application design and optimization(performance-oriented/resource-oriented)in reference to varying application aspects,cryptosystems on the hardware architecture are compared with other implementation methods in terms of security,flexibility,resource consumption and throughput,which demonstrates the efficiency and practicability of the method.
作者 何诗洋 李晖 李凤华 HE Shi-Yang;LI Hui;LI Feng-Hua(Engineering Research Center of Big Data Security,Ministry of Education,Xi’an 710126,China;School of Cyber Engineering,Xidian University,Xi’an 710126,China;Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China)
出处 《密码学报》 CSCD 2021年第6期1019-1038,共20页 Journal of Cryptologic Research
基金 国家自然科学基金重点项目(61932015) 陕西省重点研发计划(2019ZDLGY12-09) 移动互联网安全陕西省创新团队(2018TD-007) 移动互联网安全111学科创新引智基地(B16037)。
关键词 后量子 格基密码 硬件 FPGA实现 post-quantum cryptography lattice-based cryptosystem hardware FPGA implementation
  • 相关文献

参考文献2

二级参考文献12

  • 1Daniele Micciancio.Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions[J].computational complexity.2007(4)
  • 2A. K. Lenstra,H. W. Lenstra,L. Lovász.Factoring polynomials with rational coefficients[J].Mathematische Annalen.1982(4)
  • 3Oded Regev.On lattices, learning with errors, random linear codes, and cryptography[J].Journal of the ACM (JACM).2009(6)
  • 4Johannes Bl?mer,Stefanie Naewe.Sampling methods for shortest vectors, closest vectors and successive minima[J].Theoretical Computer Science.2009(18)
  • 5Phong Q. Nguyen,Thomas Vidick.Sieve algorithms for the shortest vector problem are practical[J].Journal of Mathematical Cryptology.2008(2)
  • 6Jean-Sebastien Coron,Alexander May.Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring[J].Journal of Cryptology.2007(1)
  • 7Dorit Aharonov,Oded Regev.Lattice problems in NP ∩ coNP[J].Journal of the ACM (JACM).2005(5)
  • 8Subhash Khot.Hardness of approximating the shortest vector problem in lattices[J].Journal of the ACM (JACM).2005(5)
  • 9Phong Q. Nguyen,Igor E. Shparlinski.The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces[J].Designs Codes and Cryptography.2003(2)
  • 10I. Dinur,G. Kindler,R. Raz,S. Safra.Approximating CVP to Within Almost-Polynomial Factors is NP-Hard[J].COMBINATORICA.2003(2)

共引文献44

同被引文献36

引证文献8

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部