Hardware Constructions for Error Detection of Number-Theoretic Transform Utilized in Secure Cryptographic Architectures
- 3 December 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 27 (3) , 738-741
Abstract
Polynomial multiplication is one of the most rigorous arithmetic construction of postquantum cryptosystems. Utilizing number-theoretic transformations, the product of such multiplication can be efficiently computed in quasi-linear time O(n.lgn). Error detection schemes of number-theoretic transform (NTT) architectures are essential to ensure correct mathematical operations, improved security, and thwart active side-channel attacks mounted through faults. NTT is not only significant to post-quantum cryptosystems, but the structure is also valuable to the already existing security protocols, e.g., signature schemes, hash functions, and the like. This paper, for the first time, introduces new error detection schemes of NTT architectures, successfully detecting both permanent and transient faults. Our schemes are based on recomputing with negated, scaled, and swapped operands. We have implemented the proposed schemes on the application-specific integrated circuit (ASIC). Performance and implementation metrics on this hardware platform show acceptable hardware overhead. As our schemes provide acceptable complexity and high efficiency, they can be utilized in compact hardware implementations of constrained applications, e.g., deeply embedded architectures.Keywords
Funding Information
- National Science Foundation (SaTC-1801488)
This publication has 22 references indexed in Scilit:
- High-Speed Polynomial Multiplication Architecture for Ring-LWE and SHE CryptosystemsIEEE Transactions on Circuits and Systems I: Regular Papers, 2014
- On Ideal Lattices and Learning with Errors over RingsJournal of the ACM, 2013
- Fault Detection Structures of the S-boxes and the Inverse S-boxes for the Advanced Encryption StandardJournal of Electronic Testing, 2009
- Lattice-based Cryptography2009
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures2009
- SWIFFT: A Modest Proposal for FFT Hashing2008
- Lattice-Based Identification Schemes Secure Under Active Attacks2008
- Generalized Compact Knapsacks Are Collision Resistant2006
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965