Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units

With the development of the Internet of Things (IoT) and cloud computing technology, various cryptographic systems have been proposed to protect increasing personal information. Recently, Post-Quantum Cryptography (PQC) algorithms have been proposed to counter quantum algorithms that threaten public...

Full description

Bibliographic Details
Main Authors: SangWoo An, Seog Chung Seo
Format: Article
Language:English
Published: MDPI AG 2020-10-01
Series:Mathematics
Subjects:
PQC
LWE
Online Access:https://www.mdpi.com/2227-7390/8/10/1781
id doaj-df78c6788ea3488f8af02f470111893c
record_format Article
spelling doaj-df78c6788ea3488f8af02f470111893c2020-11-25T02:46:28ZengMDPI AGMathematics2227-73902020-10-0181781178110.3390/math8101781Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing UnitsSangWoo An0Seog Chung Seo1Department of Financial Information Security, Kookmin University, Seoul 02707, KoreaDepartment of Information Security, Cryptology, and Mathematics, Kookmin University, Seoul 02707, KoreaWith the development of the Internet of Things (IoT) and cloud computing technology, various cryptographic systems have been proposed to protect increasing personal information. Recently, Post-Quantum Cryptography (PQC) algorithms have been proposed to counter quantum algorithms that threaten public key cryptography. To efficiently use PQC in a server environment dealing with large amounts of data, optimization studies are required. In this paper, we present optimization methods for FrodoKEM and NewHope, which are the NIST PQC standardization round 2 competition algorithms in the Graphics Processing Unit (GPU) platform. For each algorithm, we present a part that can perform parallel processing of major operations with a large computational load using the characteristics of the GPU. In the case of FrodoKEM, we introduce parallel optimization techniques for matrix generation operations and matrix arithmetic operations such as addition and multiplication. In the case of NewHope, we present a parallel processing technique for polynomial-based operations. In the encryption process of FrodoKEM, the performance improvements have been confirmed up to 5.2, 5.75, and 6.47 times faster than the CPU implementation in FrodoKEM-640, FrodoKEM-976, and FrodoKEM-1344, respectively. In the encryption process of NewHope, the performance improvements have been shown up to 3.33 and 4.04 times faster than the CPU implementation in NewHope-512 and NewHope-1024, respectively. The results of this study can be used in the IoT devices server or cloud computing service server. In addition, the results of this study can be utilized in image processing technologies such as facial recognition technology.https://www.mdpi.com/2227-7390/8/10/1781PQClattice-basedLWERLWEFrodoKEMNewHope
collection DOAJ
language English
format Article
sources DOAJ
author SangWoo An
Seog Chung Seo
spellingShingle SangWoo An
Seog Chung Seo
Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
Mathematics
PQC
lattice-based
LWE
RLWE
FrodoKEM
NewHope
author_facet SangWoo An
Seog Chung Seo
author_sort SangWoo An
title Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
title_short Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
title_full Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
title_fullStr Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
title_full_unstemmed Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
title_sort efficient parallel implementations of lwe-based post-quantum cryptosystems on graphics processing units
publisher MDPI AG
series Mathematics
issn 2227-7390
publishDate 2020-10-01
description With the development of the Internet of Things (IoT) and cloud computing technology, various cryptographic systems have been proposed to protect increasing personal information. Recently, Post-Quantum Cryptography (PQC) algorithms have been proposed to counter quantum algorithms that threaten public key cryptography. To efficiently use PQC in a server environment dealing with large amounts of data, optimization studies are required. In this paper, we present optimization methods for FrodoKEM and NewHope, which are the NIST PQC standardization round 2 competition algorithms in the Graphics Processing Unit (GPU) platform. For each algorithm, we present a part that can perform parallel processing of major operations with a large computational load using the characteristics of the GPU. In the case of FrodoKEM, we introduce parallel optimization techniques for matrix generation operations and matrix arithmetic operations such as addition and multiplication. In the case of NewHope, we present a parallel processing technique for polynomial-based operations. In the encryption process of FrodoKEM, the performance improvements have been confirmed up to 5.2, 5.75, and 6.47 times faster than the CPU implementation in FrodoKEM-640, FrodoKEM-976, and FrodoKEM-1344, respectively. In the encryption process of NewHope, the performance improvements have been shown up to 3.33 and 4.04 times faster than the CPU implementation in NewHope-512 and NewHope-1024, respectively. The results of this study can be used in the IoT devices server or cloud computing service server. In addition, the results of this study can be utilized in image processing technologies such as facial recognition technology.
topic PQC
lattice-based
LWE
RLWE
FrodoKEM
NewHope
url https://www.mdpi.com/2227-7390/8/10/1781
work_keys_str_mv AT sangwooan efficientparallelimplementationsoflwebasedpostquantumcryptosystemsongraphicsprocessingunits
AT seogchungseo efficientparallelimplementationsoflwebasedpostquantumcryptosystemsongraphicsprocessingunits
_version_ 1724758080810385408