Extending the ElGamal Cryptosystem to the Third Group of Units of $\Z_{n}$

• URL: http://arxiv.org/abs/2504.15202v1
• Date: Mon, 21 Apr 2025 16:17:53 GMT
• Title: Extending the ElGamal Cryptosystem to the Third Group of Units of $\Z_{n}$
• Authors: Jana Hamza, Mohammad EL Hindi, Seifeddine Kadri, Therrar Kadri, Yahya Awad,
• Abstract summary: We extend the ElGamal cryptosystem to the third group of units of the ring $Z_n$, which we prove to be more secure than the previous extensions.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: In this paper, we extend the ElGamal cryptosystem to the third group of units of the ring $\Z_{n}$, which we prove to be more secure than the previous extensions. We describe the arithmetic needed in the new setting. We also provide some numerical simulations that shows the security and efficiency of our proposed cryptosystem.

Related papers

• The Rabin cryptosystem over number fields [44.99833362998488]
  We show that decryption of a random plaintext is as hard as the integer factorisation problem.<n>We investigate the performance of our new cryptosystem in comparison with the classical Rabin scheme.
  arXiv  Detail & Related papers  (2025-06-11T10:05:00Z)
• Secured Encryption scheme based on the Ree groups [0.0]
  An improved design of a cryptosystem based on small Ree groups is proposed. We have changed the encryption algorithm and propose to use a logarithmic signature for the entire Ree group.
  arXiv  Detail & Related papers  (2025-04-24T20:21:02Z)
• Advanced MST3 Encryption scheme based on generalized Suzuki 2-groups [0.0]
  This article presents a method for enhancing the encryption algorithm in the MST3 cryptosystem for generalized Suzuki 2-groups.<n>In our approach, the logarithmic signature extends across the entire group, with cipher security dependent on the group order.
  arXiv  Detail & Related papers  (2025-04-16T06:32:45Z)
• Cryptographic Strengthening of MST3 cryptosystem via Automorphism Group of Suzuki Function Fields [0.0]
  The article describes a new implementation of MST3 cryptosystems based on the automorphism group of the Suzuki function field.<n>The complexity of cryptanalysis and the size of the message for encryption squared is higher than that of the MST3 cryptosystem in the Suzuki group.
  arXiv  Detail & Related papers  (2025-04-09T22:37:08Z)
• Optimal Computational Secret Sharing [51.599517747577266]
  In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants. We present a construction achieving a share size of $tfrac|S|t + |K|t$.
  arXiv  Detail & Related papers  (2025-02-04T23:37:16Z)
• An RSA Cryptosystem over a Halidon Group Ring of a Dihedral Group [0.0]
  The article explores the creation of a cryptosystem using a halidon group ring of a dihedral group. The logic used to develop a decryption programme was also quite complex.
  arXiv  Detail & Related papers  (2024-10-28T10:44:16Z)
• Security Assessment of the LG Cryptosystem [0.0]
  The LG cryptosystem is a public-key encryption scheme in the rank metric using the recent family of $lambdav-$Gabidulin codes. We present a cryptanalysis showing that the security of several parameters of the scheme have been overestimated.
  arXiv  Detail & Related papers  (2024-04-10T08:02:18Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring [55.17220687298207]
  The threshold secret sharing scheme allows the dealer to distribute the share to every participant that the secret is correctly recovered from a certain amount of shares. We propose a brand-new construction of evolving $k$-threshold secret sharing scheme for an $ell$-bit secret over a ring, with correctness and perfect security.
  arXiv  Detail & Related papers  (2024-02-02T05:04:01Z)
• Communication-Constrained Bandits under Additive Gaussian Noise [111.06688156723018]
  We study a distributed multi-armed bandit where a client supplies the learner with communication-constrained feedback. We propose a multi-phase bandit algorithm, $mathttUEtext-UCB++$, which matches this lower bound to a minor additive factor.
  arXiv  Detail & Related papers  (2023-04-25T09:31:20Z)
• RiDDLE: Reversible and Diversified De-identification with Latent Encryptor [57.66174700276893]
  This work presents RiDDLE, short for Reversible and Diversified De-identification with Latent Encryptor. Built upon a pre-learned StyleGAN2 generator, RiDDLE manages to encrypt and decrypt the facial identity within the latent space.
  arXiv  Detail & Related papers  (2023-03-09T11:03:52Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.