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...
Main Author: | Teşeleanu, G. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Key-Aggregate Searchable Encryption, Revisited: Formal Foundations for Cloud Applications, and Their Implementation
by: Masahiro Kamimura, et al.
Published: (2020-01-01) -
A New Technique in Rank Metric Code-Based Encryption
by: Terry Shue Chien Lau, et al.
Published: (2018-10-01) -
Security Analysis and Enhancement of a Certificateless Searchable Public Key Encryption Scheme for IIoT Environments
by: Tsu-Yang Wu, et al.
Published: (2019-01-01) -
Key Assignment Schemes with Authenticated Encryption, revisited
by: Jeroen Pijnenburg, et al.
Published: (2020-07-01) -
Another look at HMQV
by: Menezes Alfred
Published: (2007-01-01)