Paper 2022/522

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

George Teseleanu

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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Minor revision.MDPI Mathematics
Keywords
public key encryptiongap $2^k$-residuosityprovable security
Contact author(s)
george teseleanu @ yahoo com
History
2022-05-02: received
Short URL
https://ia.cr/2022/522
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/522,
      author = {George Teseleanu},
      title = {The Case of Small Prime Numbers Versus the Joye-Libert Cryptosystem},
      howpublished = {Cryptology ePrint Archive, Paper 2022/522},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/522}},
      url = {https://eprint.iacr.org/2022/522}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.