High-throughput Low-complexity Mixed-radix FFT Processor using a Dual-path Shared Complex Constant Multiplier

Nguyen, Tram Thi Bao; Lee, Hanho

doi:10.5573/jsts.2017.17.1.101

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NTT is a variant of the conventional fast Fourier transform (FFT) [16,17] with arithmetic operations being performed in a finite field. NTT uses the n-th primitive root of unity ω n in the ring Z q .…”

Section: Proposed Dual-path Delay Feedback Ntt Architecture For Kybermentioning

confidence: 99%

Area-Time Efficient Hardware Architecture for CRYSTALS-Kyber

et al. 2022

Self Cite

View full text Add to dashboard Cite

This paper presents a novel area-time efficient hardware architecture of the lattice-based CRYSTALS-Kyber, which has entered the third round of the post-quantum cryptography standardization competition hosted by the National Institute of Standards and Technology. By developing a dual-path delay feedback number theoretic transform multiplier dedicating for Kyber parameter set and deploying this multiplier in the Kyber architecture, the key generation, encryption, and decryption operations are accelerated substantially. Furthermore, the proposed architecture offers the best value of area-time product in comparison with existing approaches. The implementation results on Xilinx Vivado targeted for Virtex-7 FPGA board demonstrate that the proposed Kyber cryptoprocessor completes encryption and decryption operations in approximately 57.5 μs at the highest frequency of 226 MHz. Furthermore, the area-time product value when using the proposed Kyber architecture is improved by at least twofold compared with existing architectures.

show abstract

Section: Proposed Dual-path Delay Feedback Ntt Architecture For Kybermentioning

confidence: 99%

Area-Time Efficient Hardware Architecture for CRYSTALS-Kyber

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…Polynomial multiplication in R q using NTT offers multiple advantages [18]: simple code space, high speed, and no additional memory is required. NTT is a form of the wellknown fast Fourier transform (FFT) [27,28], with all arithmetic operations performed in a finite field. NTT uses the n-th primitive root of unity ω n in the ring Z q .…”

Section: Number Theoretic Transformmentioning

confidence: 99%

An Analysis of Hardware Design of MLWE-Based Public-Key Encryption and Key-Establishment Algorithms

2022

Self Cite

View full text Add to dashboard Cite

This paper presents a review of module ring learning with errors-based (MLWE-based) public-key encryption and key-establishment algorithms. In particular, we introduce the preliminaries of public key cryptography, MLWE-based algorithms, and arithmetic operations in post-quantum cryptography. We then focus on analyzing the state-of-the-art hardware architecture designs of CRYSTALS-Kyber at different security levels, including hardware architectures for Kyber-512, Kyber-768, and Kyber-1024. This analysis is dedicated to providing complete guidelines for selecting the most suitable CRYSTALS-Kyber hardware architecture to apply in post-quantum cryptography-based security systems in reality, with different requirements of security levels and hardware efficiency.

show abstract