AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem

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

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

^*Corresponding author for this work

Queen's University Belfast

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

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
Title of host publication	2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781728133201
DOIs	https://doi.org/10.1109/ISCAS45731.2020.9180839
Publication status	Published - 28 Sep 2020
Event	52nd IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Virtual, Online Duration: 10 Oct 2020 → 21 Oct 2020

Publication series

Name	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	2020-October
ISSN (Print)	0271-4310

Conference

Conference	52nd IEEE International Symposium on Circuits and Systems, ISCAS 2020
City	Virtual, Online
Period	10/10/2020 → 21/10/2020

Bibliographical note

Funding Information:
*The authors gratefully acknowledge the support of K.C.Wong Education Foundation.

Publisher Copyright:
© 2020 IEEE

Keywords

Approximate computing (AC)
Lattice-based cryptography (LBC)
Ring-learning with errors (R-LWE)

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/ISCAS45731.2020.9180839Licence: Unspecified

Cite this

Kundi, D-S., Bian, S., Khalid, A., Wang, C., O'Neill, M., & Liu, W. (2020). AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem. In 2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings [9180839] (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2020-October). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCAS45731.2020.9180839

Kundi, Dur-e-Shahwar ; Bian, Song ; Khalid, Ayesha ; Wang, Chenghua ; O'Neill, Máire ; Liu, Weiqiang. / AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem. 2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2020. (Proceedings - IEEE International Symposium on Circuits and Systems).

@inproceedings{27b50cad8e2f4ca6b2b8b08d4baeb5e1,

title = "AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem",

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 = "Dur-e-Shahwar Kundi and Song Bian and Ayesha Khalid and Chenghua Wang and M{\'a}ire O'Neill and Weiqiang Liu",

note = "Funding Information: *The authors gratefully acknowledge the support of K.C.Wong Education Foundation. 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",

month = sep,

day = "28",

doi = "10.1109/ISCAS45731.2020.9180839",

language = "English",

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

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

booktitle = "2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings",

}

Kundi, D-S, Bian, S, Khalid, A, Wang, C, O'Neill, M & Liu, W 2020, AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem. in 2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings., 9180839, Proceedings - IEEE International Symposium on Circuits and Systems, vol. 2020-October, Institute of Electrical and Electronics Engineers Inc., 52nd IEEE International Symposium on Circuits and Systems, ISCAS 2020, Virtual, Online, 10/10/2020. https://doi.org/10.1109/ISCAS45731.2020.9180839

AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem. / Kundi, Dur-e-Shahwar; Bian, Song; Khalid, Ayesha; Wang, Chenghua; O'Neill, Máire; Liu, Weiqiang.

2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2020. 9180839 (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2020-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem

AU - Kundi, Dur-e-Shahwar

AU - Bian, Song

AU - Khalid, Ayesha

AU - Wang, Chenghua

AU - O'Neill, Máire

AU - Liu, Weiqiang

PY - 2020/9/28

Y1 - 2020/9/28

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)

U2 - 10.1109/ISCAS45731.2020.9180839

DO - 10.1109/ISCAS45731.2020.9180839

M3 - Conference contribution

AN - SCOPUS:85096736611

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

BT - 2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 10 October 2020 through 21 October 2020

ER -

Kundi D-S, Bian S, Khalid A, Wang C, O'Neill M, Liu W. AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem. In 2020 IEEE International Symposium on Circuits and Systems, ISCAS 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2020. 9180839. (Proceedings - IEEE International Symposium on Circuits and Systems). https://doi.org/10.1109/ISCAS45731.2020.9180839

AXMM: Area and power efficient approximate modular multiplier for R-LWE cryptosystem

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this