Close

Presentation

Efficient Implementation of Finite Field Arithmetic for Binary Ring-LWE Post-Quantum Cryptography Through a Novel Lookup-Table-Like Method
TimeThursday, December 9th11:00am - 11:30am PST
Location3016
Event Type
Research Manuscript
Virtual Programs
Presented In-Person
Keywords
Hardware Security: Primitives, Architecture, Design & Test
Topics
Security
DescriptionIn this paper, we aim to present efficient implementations of the finite field arithmetic (key component) for the binary Ring-Learning-with-Errors (Ring-LWE) PQC through a novel lookup-table (LUT)-like method. In total, we have carried out four stages of interdependent efforts: (i) an algorithm-hardware co-design driven derivation of the proposed LUT-like method is provided; (ii) the proposed hardware architecture is then presented; (iii) we have also presented a novel hybrid size structure, which is the first report in the literature; (iv) the final implementation and comparison processes show that our proposed structures deliver significant improved performance over the state-of-the-art solutions.