High-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography-Reference-Cited by-同舟云学术

High-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography

Author:

Tan Weihang¹^ORCID,Wang Antian²^ORCID,Zhang Xinmiao³^ORCID,Lao Yingjie²^ORCID,Parhi Keshab K.¹^ORCID

Affiliation:

1. Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA

2. Department of Electrical and Computer Engineering, Clemson University, Clemson, SC, USA

3. Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA

Funder

Semiconductor Research Corporation

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software

Link

Reference45 articles.

1. Somewhat practical fully homomorphic encryption;fan;IACR Cryptol ePrint Arch,2012

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Design of VLSI Architecture Using AES Algorithm;2024 3rd International Conference on Artificial Intelligence For Internet of Things (AIIoT);2024-05-03

3. Efficient Hardware RNS Decomposition for Post-Quantum Signature Scheme Falcon;2023 57th Asilomar Conference on Signals, Systems, and Computers;2023-10-29