The Case of Small Prime Numbers Versus the Okamoto-Uchiyama Cryptosystem

George Teseleanu

Paper 2024/593

The Case of Small Prime Numbers Versus the Okamoto-Uchiyama Cryptosystem

George Teseleanu

Abstract

In this paper we study the effect of using small prime numbers within the Okamoto-Uchiyama public key encryption scheme. We introduce two novel versions and prove their security. Then we 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 Okamoto-Uchiyama cryptosystem.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. NuTMiC 2024
Keywords: public key encryption p-subgroup provable security
Contact author(s): george teseleanu @ yahoo com
History: 2024-04-16: approved; 2024-04-16: received; See all versions
Short URL: https://ia.cr/2024/593
License: CC BY-NC-SA

BibTeX

@misc{cryptoeprint:2024/593,
      author = {George Teseleanu},
      title = {The Case of Small Prime Numbers Versus the Okamoto-Uchiyama Cryptosystem},
      howpublished = {Cryptology ePrint Archive, Paper 2024/593},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/593}},
      url = {https://eprint.iacr.org/2024/593}
}