activity
20212024
most citedHigh-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography

30 citations · 68 across the 5 of their papers we have counts for

collaborators

5 papers

eess.SY2024

Analysis of Dead Reckoning Accuracy in Swarm Robotics System

Weihang Tan, Timothy Anglea, Yongqiang Wang

The objective of this paper is to determine the position of a single mobile robot in a swarm using dead reckoning techniques. We investigate the accuracy of navigation by using thi…

cs.CR2023★ 14 cited

KyberMat: Efficient Accelerator for Matrix-Vector Polynomial Multiplication in CRYSTALS-Kyber Scheme via NTT and Polyphase Decomposition

Weihang Tan, Yingjie Lao, Keshab K. Parhi

CRYSTAL-Kyber (Kyber) is one of the post-quantum cryptography (PQC) key-encapsulation mechanism (KEM) schemes selected during the standardization process. This paper addresses opti…

cs.AR2023★ 24 cited

PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic Encryption

Weihang Tan, Sin-Wei Chiu, Antian Wang +2

High-speed long polynomial multiplication is important for applications in homomorphic encryption (HE) and lattice-based cryptosystems. This paper addresses low-latency hardware ar…

cs.CR2022

Integral Sampler and Polynomial Multiplication Architecture for Lattice-based Cryptography

Antian Wang, Weihang Tan, Keshab K. Parhi +1

With the surge of the powerful quantum computer, lattice-based cryptography proliferated the latest cryptography hardware implementation due to its resistance against quantum compu…

cs.CR2021★ 30 cited

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

Weihang Tan, Antian Wang, Yingjie Lao +2

This paper presents a low-latency hardware accelerator for modular polynomial multiplication for lattice-based post-quantum cryptography and homomorphic encryption applications. Th…