Cryptology ePrint Archive: Report 2021/1694

RLWE-based distributed key generation and threshold decryption

Ferran Alborch and Ramiro Martínez and Paz Morillo

Abstract: Ever since the appearance of quantum computers, prime factoring and discrete logarithm based cryptography has been put in question, giving birth to the so called post-quantum cryptography. The most prominent field in post-quantum cryptography is lattice-based cryptography, protocols that are proved to be as difficult to break as certain difficult lattice problems like Learning With Errors (LWE) or Ring Learning With Errors (RLWE). Furthermore, the application of cryptographic techniques to different areas, like electronic voting, has also seen to a great interest in distributed cryptography. In this work we will give two original threshold protocols based in the lattice problem RLWE: one for key generation and one for decryption. We will prove them both correct and secure under the assumption of hardness of some well-known lattice problems and we will give a rough implementation of the protocols in C to give some tentative results about their viability.

Category / Keywords: public-key cryptography / Post-Quantum Cryptography, Threshold Cryptography, Lattices, Ring Learning With Errors (RLWE), RLWE Encryption

Date: received 23 Dec 2021

Contact author: ferran alborch at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20211230:171140 (All versions of this report)

Short URL: ia.cr/2021/1694


[ Cryptology ePrint archive ]