이주엽, 김수리, 김창한, 홍석희,

Vol. 30, No. 5, pp. 781-793, Oct. 2020
10.13089/JKIISC.2020.30.5.781, Full Text:
Keywords: Post-Quantum Cryptography, RLWE, Lattice-based cryptography, Error correcting code
Abstract

In this paper, we propose a new RLWE-based scheme named μ-Hope that exploits Error Correcting Code(ECC) onNewHope. The previous parameters of NewHope uses 12289 as a prime modulus, and the size of the public key, privatekey, and ciphertext is 928-byte, 1888-byte, and 1120-byte respectively, which can be said to be larger than other RLWEbased algorithms. In this paper, we propose μ-Hope, which changes modulus 12289 to 769 to reduce the size of the publickey, private key, and ciphertext. Also, we adopts XE1 as an Error Correcting Code(ECC) to solve the increased decryptionfailure rate caused by using a small prime modulus. As a result, the size of the public key, private key, and ciphertextdecreased by 928-byte, 1888-byte and 1120-byte respectively. As the computational efficiency caused by using a small prime modulusexceeds the performance degradation by exploiting ECC, this result in 25% performance improvement for a single keyexchange

Statistics
Cite this article