AxMM: Area and Power Efficient Approximate Modular Multiplier for R-LWE Cryptosystem (Invited Paper)

Dur E.Shahwar Kundi; Song Bian; Ayesha Khalid; Chenghua Wang; Máire O'Neill; Weiqiang Liu

doi:10.1109/ISCAS45731.2020.9180839

AxMM: Area and Power Efficient Approximate Modular Multiplier for R-LWE Cryptosystem (Invited Paper)

Dur E.Shahwar Kundi^*
, Song Bian
, Ayesha Khalid
, Chenghua Wang^*
, Máire O'Neill
, Weiqiang Liu^*

^*Corresponding author for this work

Nanjing University of Aeronautics and Astronautics
Kyoto University
Queen's University Belfast

Research output: Contribution to journal › Conference article › peer-review

10 Scopus citations

Abstract

Amongst various Post-Quantum Cryptographic (PQC) schemes, Lattice-Based Cryptography (LBC) stands out as the most viable substitute to the classical cryptographic schemes due to its efficiency, versatility and solid foundations on hard mathematical problems. Ring Learning With Errors (R-LWE) is a Public Key Encryption (PKE) scheme of LBC, in which the modular polynomial multiplication in a ring is the main bottleneck in the realization of a practical resource-constraint design for the embedded IoT devices. This work explores novel Approximate Computing (AC) technique for the design of area/power efficient modular multiplier (so called AxMM) for R-LWE, exploiting the inherent approximate structure of the scheme. The proposed AxMM on 45nm ASIC library achieved an area and power reduction of 36% and 23%, respectively, along with a speed increase of 1.34× as compared to state-of-art smallest exact R-LWE modular multiplier.

Original language	English
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	2020-January
DOIs	https://doi.org/10.1109/ISCAS45731.2020.9180839
State	Published - 2020
Externally published	Yes
Event	52nd IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Virtual, Online Duration: 10 Oct 2020 → 21 Oct 2020

Keywords

Approximate Computing (AC)
Lattice-Based Cryptography (LBC)
Ring-Learning With Errors (R-LWE)

Access to Document

10.1109/ISCAS45731.2020.9180839

Cite this

@article{a5c194842c3e48ddaddf367b869ff40f,

title = "AxMM: Area and Power Efficient Approximate Modular Multiplier for R-LWE Cryptosystem (Invited Paper)",

abstract = "Amongst various Post-Quantum Cryptographic (PQC) schemes, Lattice-Based Cryptography (LBC) stands out as the most viable substitute to the classical cryptographic schemes due to its efficiency, versatility and solid foundations on hard mathematical problems. Ring Learning With Errors (R-LWE) is a Public Key Encryption (PKE) scheme of LBC, in which the modular polynomial multiplication in a ring is the main bottleneck in the realization of a practical resource-constraint design for the embedded IoT devices. This work explores novel Approximate Computing (AC) technique for the design of area/power efficient modular multiplier (so called AxMM) for R-LWE, exploiting the inherent approximate structure of the scheme. The proposed AxMM on 45nm ASIC library achieved an area and power reduction of 36\% and 23\%, respectively, along with a speed increase of 1.34× as compared to state-of-art smallest exact R-LWE modular multiplier.",

keywords = "Approximate Computing (AC), Lattice-Based Cryptography (LBC), Ring-Learning With Errors (R-LWE)",

author = "Kundi, \{Dur E.Shahwar\} and Song Bian and Ayesha Khalid and Chenghua Wang and M{\'a}ire O'Neill and Weiqiang Liu",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 52nd IEEE International Symposium on Circuits and Systems, ISCAS 2020 ; Conference date: 10-10-2020 Through 21-10-2020",

year = "2020",

doi = "10.1109/ISCAS45731.2020.9180839",

language = "英语",

volume = "2020-January",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - AxMM

T2 - 52nd IEEE International Symposium on Circuits and Systems, ISCAS 2020

AU - Kundi, Dur E.Shahwar

AU - Bian, Song

AU - Khalid, Ayesha

AU - Wang, Chenghua

AU - O'Neill, Máire

AU - Liu, Weiqiang

PY - 2020

Y1 - 2020

N2 - Amongst various Post-Quantum Cryptographic (PQC) schemes, Lattice-Based Cryptography (LBC) stands out as the most viable substitute to the classical cryptographic schemes due to its efficiency, versatility and solid foundations on hard mathematical problems. Ring Learning With Errors (R-LWE) is a Public Key Encryption (PKE) scheme of LBC, in which the modular polynomial multiplication in a ring is the main bottleneck in the realization of a practical resource-constraint design for the embedded IoT devices. This work explores novel Approximate Computing (AC) technique for the design of area/power efficient modular multiplier (so called AxMM) for R-LWE, exploiting the inherent approximate structure of the scheme. The proposed AxMM on 45nm ASIC library achieved an area and power reduction of 36% and 23%, respectively, along with a speed increase of 1.34× as compared to state-of-art smallest exact R-LWE modular multiplier.

AB - Amongst various Post-Quantum Cryptographic (PQC) schemes, Lattice-Based Cryptography (LBC) stands out as the most viable substitute to the classical cryptographic schemes due to its efficiency, versatility and solid foundations on hard mathematical problems. Ring Learning With Errors (R-LWE) is a Public Key Encryption (PKE) scheme of LBC, in which the modular polynomial multiplication in a ring is the main bottleneck in the realization of a practical resource-constraint design for the embedded IoT devices. This work explores novel Approximate Computing (AC) technique for the design of area/power efficient modular multiplier (so called AxMM) for R-LWE, exploiting the inherent approximate structure of the scheme. The proposed AxMM on 45nm ASIC library achieved an area and power reduction of 36% and 23%, respectively, along with a speed increase of 1.34× as compared to state-of-art smallest exact R-LWE modular multiplier.

KW - Approximate Computing (AC)

KW - Lattice-Based Cryptography (LBC)

KW - Ring-Learning With Errors (R-LWE)

UR - https://www.scopus.com/pages/publications/85136072619

U2 - 10.1109/ISCAS45731.2020.9180839

DO - 10.1109/ISCAS45731.2020.9180839

M3 - 会议文章

AN - SCOPUS:85136072619

SN - 0271-4310

VL - 2020-January

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

Y2 - 10 October 2020 through 21 October 2020

ER -

AxMM: Area and Power Efficient Approximate Modular Multiplier for R-LWE Cryptosystem (Invited Paper)

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this