The Rabin cryptosystem over number fields

• URL: http://arxiv.org/abs/2506.09569v1
• Date: Wed, 11 Jun 2025 10:05:00 GMT
• Title: The Rabin cryptosystem over number fields
• Authors: Alessandro Cobbe, Andreas Nickel, Akay Schuster,
• Abstract summary: 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.
• Score: 44.99833362998488
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We extend Rabin's cryptosystem to general number fields. We show that decryption of a random plaintext is as hard as the integer factorisation problem, provided the modulus in our scheme has been chosen carefully. We investigate the performance of our new cryptosystem in comparison with the classical Rabin scheme and a more recent version over the Gaussian integers.

Related papers

• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Extending the ElGamal Cryptosystem to the Third Group of Units of $\Z_{n}$ [0.0]
  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.
  arXiv  Detail & Related papers  (2025-04-21T16:17:53Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• The Evolution of Cryptography through Number Theory [55.2480439325792]
  cryptography began around 100 years ago, its roots trace back to ancient civilizations like Mesopotamia and Egypt.<n>This paper explores the link between early information hiding techniques and modern cryptographic algorithms like RSA.
  arXiv  Detail & Related papers  (2024-11-11T16:27:57Z)
• An Attack on $p$-adic Lattice Public-key Cryptosystems and Signature Schemes [3.444630356331766]
  In this paper, we improve the LVP algorithm in local fields.<n>We utilize this algorithm to attack the above schemes so that we are able to forge any message and decrypt any ciphertext.<n>Although these schemes are broken, this work does not mean that $p$-adic lattices are not suitable in constructing cryptographic primitives.
  arXiv  Detail & Related papers  (2024-09-13T12:31:57Z)
• The syzygy distinguisher [0.0]
  We present a new distinguisher for alternant and hence Goppa codes, whose complexity is subexponential in the error-correcting capability.<n>In particular, it applies to the codes used in the Classic McEliece candidate for postquantum cryptography standardization.
  arXiv  Detail & Related papers  (2024-07-22T15:42:06Z)
• 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)
• VDOO: A Short, Fast, Post-Quantum Multivariate Digital Signature Scheme [0.8643517734716606]
  We present a post-quantum digital signature algorithm based on solving multivariate equations. We show that our carefully chosen parameters can resist all existing state-of-the-art attacks. This is the smallest signature size among all known post-quantum signature schemes of similar security.
  arXiv  Detail & Related papers  (2023-12-15T04:58:10Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• RSA+: An RSA variant [0.0]
  We introduce a new probabilistic public-key cryptosystem which combines the main ingredients of the well-known RSA and Rabin cryptosystems. We investigate the security and performance of our new scheme in comparison to the other two.
  arXiv  Detail & Related papers  (2022-12-31T02:48:17Z)

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.