The Case of Small Prime Numbers Versus the Joye–Libert Cryptosystem

The Case of Small Prime Numbers Versus the Joye–Libert Cryptosystem

In this paper, we study the effect of using small prime numbers within the Joye–Libert public key encryption scheme. We introduce two novel versions and prove their security. We further show how to choose the system’s parameters such that the security results hold. Moreover, we provide a practical c...

Full description

Bibliographic Details
Main Author: Teşeleanu, G. (Author)
Format: Article
Language:English
Published: MDPI 2022
Subjects:
gap 2k-residuosity
provable security
public key encryption
Online Access:View Fulltext in Publisher
LEADER 00998nam a2200169Ia 4500
001 10.3390-math10091577
008 220706s2022 CNT 000 0 und d
020 |a 22277390 (ISSN) 
245 1 0 |a The Case of Small Prime Numbers Versus the Joye–Libert Cryptosystem 
260 0 |b MDPI  |c 2022 
856 |z View Fulltext in Publisher  |u https://doi.org/10.3390/math10091577 
520 3 |a In this paper, we study the effect of using small prime numbers within the Joye–Libert public key encryption scheme. We introduce two novel versions and prove their security. We further show how to choose the system’s parameters such that the security results hold. Moreover, we provide a practical comparison between the cryptographic algorithms we introduced and the original Joye–Libert cryptosystem. © 2022 by the authors. Licensee MDPI, Basel, Switzerland. 
650 0 4 |a gap 2k-residuosity 
650 0 4 |a provable security 
650 0 4 |a public key encryption 
700 1 |a Teşeleanu, G.  |e author 
773 |t Mathematics 

Similar Items