RT Journal Article
T1 Efficient hardware implementation of finite field arithmetic AB + C for Binary ring-LWE based post-quantum cryptography
A1 Xie, Jiafeng
A1 He, Pengzhou
A1 Wang, Xiaofang
A1 Imaña Pascual, José Luis
AB Post-quantum cryptography (PQC) has gained significant attention from the community recently as it is proven that the existing public-key cryptosystems are vulnerable to the attacks launched from the well-developed quantum computers. The finite field arithmetic AB + C, where A and C are integer polynomials and B is a binary polynomial, is the key component for the binary Ring-learning-with-errors (BRLWE)-based encryption scheme (a low-complexity PQC suitable for emerging lightweight applications). In this paper, we propose a novel hardware implementation of the finite field arithmetic AB + C through three stages of inter-dependent efforts: (i) a rigorous mathematical formulation process is presented first; (ii) an efficient hardware architecture is then presented with detailed description; (iii) a thorough implementation has also been given along with the comparison. Overall, (i) the proposed basic structure (u = 1) outperforms the existing designs, e.g., it involves 55.9% less area-delay product (ADP) than [13] for n = 512; (ii) the proposed design also offers very efficient performance in time-complexity and can be used in many future applications.
PB IEEE Institute of Electrical and Electronics Engineers
SN 2168-6750
YR 2022
FD 2022-04
LK https://hdl.handle.net/20.500.14352/71695
UL https://hdl.handle.net/20.500.14352/71695
LA eng
NO (c) 2022 IEEE Institute of Electrical and Electronics EngineersThe work of Jiafeng Xie was supported by the NSFAward under Grants 2020625 and NIST-60NANB20D203. The work of Jose L. Imaña was supported by the Spanish MINECO and CM under Grants S2018/TCS-4423 and RTI2018-093684-B-I00.
NO Ministerio de Ciencia e Innovación (MICINN) /FEDER
NO Comunidad de Madrid
DS Docta Complutense
RD 9 may 2025