An Efficient and Parallel R-LWE Cryptoprocessor

Yuqing Zhang; Chenghua Wang; Dur E.Shahwar Kundi; Ayesha Khalid; Maire O'Neill; Weiqiang Liu

doi:10.1109/TCSII.2020.2980387

An Efficient and Parallel R-LWE Cryptoprocessor

Yuqing Zhang, Chenghua Wang, Dur E.Shahwar Kundi, Ayesha Khalid, Maire O'Neill, Weiqiang Liu^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

57 Downloads (Pure)

Abstract

Lattice-based cryptography (LBC) is a promising and efficient public key cryptography scheme whose theoretical foundation usually lies in Learning with Error (LWE) problem and its variant such as Ring-LWE (R-LWE) is the most studied cryptosystem which allows for more efficient implementation while maintaining the hardness of an original problem. Polynomial multiplication is the bottleneck of R-LWE, that can either be done using Number Theoretic Transform (NTT) or schoolbook polynomial multiplication (SPM) algorithm. The use of SPM is wider and possible for all parameters of R-LWE schemes. This brief proposes an efficient and parallel strategy for SPM in R-LWE; by successfully reducing its time complexity from n^{2} to n^{2}/4 (making it 1.8\times faster and 1.4\times hardware efficient). Furthermore, by adjusting the bit width for the error terms, the polynomial multiplication and addition blocks are reused for both encryption and decryption modules resulting in 14% reduced area and 1.7\times better throughput in comparison to state-of-Art SPM based R-LWE designs.

Original language	English
Article number	9034176
Pages (from-to)	886-890
Number of pages	5
Journal	IEEE Transactions on Circuits and Systems II: Express Briefs
Volume	67
Issue number	5
DOIs	https://doi.org/10.1109/TCSII.2020.2980387
Publication status	Published - 12 Mar 2020

Keywords

Lattice-based cryptography (LBC)
ring learning with errors (R-LWE)
schoolbook polynomial multiplication (SPM)

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCSII.2020.2980387Licence: Unspecified

An Efficient and Parallel R-LWE Cryptoprocessor
Copyright 2020 IEEE. This work is made available online in accordance with the publisher’s policies. Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 425 KBLicence: Unspecified

Fingerprint Dive into the research topics of 'An Efficient and Parallel R-LWE Cryptoprocessor'. Together they form a unique fingerprint.

Cite this

@article{2fce16e9c56a47f5bc85a87086b79687,

title = "An Efficient and Parallel R-LWE Cryptoprocessor",

abstract = "Lattice-based cryptography (LBC) is a promising and efficient public key cryptography scheme whose theoretical foundation usually lies in Learning with Error (LWE) problem and its variant such as Ring-LWE (R-LWE) is the most studied cryptosystem which allows for more efficient implementation while maintaining the hardness of an original problem. Polynomial multiplication is the bottleneck of R-LWE, that can either be done using Number Theoretic Transform (NTT) or schoolbook polynomial multiplication (SPM) algorithm. The use of SPM is wider and possible for all parameters of R-LWE schemes. This brief proposes an efficient and parallel strategy for SPM in R-LWE; by successfully reducing its time complexity from n^{2} to n^{2}/4 (making it 1.8\times faster and 1.4\times hardware efficient). Furthermore, by adjusting the bit width for the error terms, the polynomial multiplication and addition blocks are reused for both encryption and decryption modules resulting in 14% reduced area and 1.7\times better throughput in comparison to state-of-Art SPM based R-LWE designs.",

keywords = "Lattice-based cryptography (LBC), ring learning with errors (R-LWE), schoolbook polynomial multiplication (SPM)",

author = "Yuqing Zhang and Chenghua Wang and Kundi, {Dur E.Shahwar} and Ayesha Khalid and Maire O'Neill and Weiqiang Liu",

year = "2020",

month = mar,

day = "12",

doi = "10.1109/TCSII.2020.2980387",

language = "English",

volume = "67",

pages = "886--890",

journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",

issn = "1057-7130",

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

number = "5",

}

TY - JOUR

T1 - An Efficient and Parallel R-LWE Cryptoprocessor

AU - Zhang, Yuqing

AU - Wang, Chenghua

AU - Kundi, Dur E.Shahwar

AU - Khalid, Ayesha

AU - O'Neill, Maire

AU - Liu, Weiqiang

PY - 2020/3/12

Y1 - 2020/3/12

N2 - Lattice-based cryptography (LBC) is a promising and efficient public key cryptography scheme whose theoretical foundation usually lies in Learning with Error (LWE) problem and its variant such as Ring-LWE (R-LWE) is the most studied cryptosystem which allows for more efficient implementation while maintaining the hardness of an original problem. Polynomial multiplication is the bottleneck of R-LWE, that can either be done using Number Theoretic Transform (NTT) or schoolbook polynomial multiplication (SPM) algorithm. The use of SPM is wider and possible for all parameters of R-LWE schemes. This brief proposes an efficient and parallel strategy for SPM in R-LWE; by successfully reducing its time complexity from n^{2} to n^{2}/4 (making it 1.8\times faster and 1.4\times hardware efficient). Furthermore, by adjusting the bit width for the error terms, the polynomial multiplication and addition blocks are reused for both encryption and decryption modules resulting in 14% reduced area and 1.7\times better throughput in comparison to state-of-Art SPM based R-LWE designs.

AB - Lattice-based cryptography (LBC) is a promising and efficient public key cryptography scheme whose theoretical foundation usually lies in Learning with Error (LWE) problem and its variant such as Ring-LWE (R-LWE) is the most studied cryptosystem which allows for more efficient implementation while maintaining the hardness of an original problem. Polynomial multiplication is the bottleneck of R-LWE, that can either be done using Number Theoretic Transform (NTT) or schoolbook polynomial multiplication (SPM) algorithm. The use of SPM is wider and possible for all parameters of R-LWE schemes. This brief proposes an efficient and parallel strategy for SPM in R-LWE; by successfully reducing its time complexity from n^{2} to n^{2}/4 (making it 1.8\times faster and 1.4\times hardware efficient). Furthermore, by adjusting the bit width for the error terms, the polynomial multiplication and addition blocks are reused for both encryption and decryption modules resulting in 14% reduced area and 1.7\times better throughput in comparison to state-of-Art SPM based R-LWE designs.

KW - Lattice-based cryptography (LBC)

KW - ring learning with errors (R-LWE)

KW - schoolbook polynomial multiplication (SPM)

U2 - 10.1109/TCSII.2020.2980387

DO - 10.1109/TCSII.2020.2980387

M3 - Article

AN - SCOPUS:85084362348

VL - 67

SP - 886

EP - 890

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1057-7130

IS - 5

M1 - 9034176

ER -