Implementation of the NewHope Protocol for Post-Quantum Cryptography

Abstract In this paper, we propose a faster and less resource intensive implementation of the NewHope protocol to address the problems of resource-intensive random number generators and slow running NTT modules in NewHope implementations. In the random number generation module, choose the lightweigh...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1865; no. 4; p. 42108
Main Authors Lin, Zhenghao, Chen, Guanghua
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.04.2021
Subjects
Cycle time
Modules
Numbers
Physics
Pseudorandom
Quantum cryptography
Random numbers
Online AccessGet full text

Cover

More Information
Summary:Abstract In this paper, we propose a faster and less resource intensive implementation of the NewHope protocol to address the problems of resource-intensive random number generators and slow running NTT modules in NewHope implementations. In the random number generation module, choose the lightweight pseudo-random number generator (PRNG) Trivium instead of the SHAKE function to reduce the resource usage in the random number generation module. In the NTT transformation module, a pipeline structure is used in combination with a parallel structure of four butterfly units to shorten the cycle time of butterfly operations and achieve acceleration. The experimental results show that, compared with Kuo’s design, the overall time for key exchange in this paper is reduced by 25.3%, and the consumption of FFs and LUTs is reduced by 20.2% and 38.0%, respectively.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1865/4/042108