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

George Teşeleanu
Additional contact information
George Teşeleanu: Advanced Technologies Institute, 10 Dinu Vintilă, 021102 Bucharest, Romania

Mathematics, 2022, vol. 10, issue 9, 1-15

Abstract: 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.

Keywords: public key encryption; gap 2 k -residuosity; provable security (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/9/1577/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/9/1577/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:9:p:1577-:d:810274

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().