RSA+: An RSA variant

• URL: http://arxiv.org/abs/2301.01282v2
• Date: Mon, 25 Mar 2024 12:25:14 GMT
• Title: RSA+: An RSA variant
• Authors: Soeren Kleine, Andreas Nickel, Torben Ritter, Krishnan Shankar,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 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.

Related papers

• DM-RSA: An Extension of RSA with Dual Modulus [0.0]
  DM-RSA is a variant of the RSA cryptosystem that employs two distinct moduli symmetrically to enhance security.<n>By leveraging the Chinese Remainder Theorem (CRT) for decryption, DM-RSA provides increased robustness against side-channel attacks.
  arXiv  Detail & Related papers  (2025-07-14T14:09:53Z)
• 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)
• A Geometric Square-Based Approach to RSA Integer Factorization [0.0]
  We present a new approach to RSA factorization inspired by geometric interpretations and square differences.<n>This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that allows rapid convergence.
  arXiv  Detail & Related papers  (2025-06-01T08:55:25Z)
• 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)
• 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. These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem. 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)
• Quantum inspired factorization up to 100-bit RSA number in polynomial time [0.0]
  We attack the RSA factorization building on Schnorr's mathematical framework. We factorize RSA numbers up to 256 bits encoding the optimization problem in quantum systems. Results do not currently undermine the security of the present communication infrastructure.
  arXiv  Detail & Related papers  (2024-10-21T18:00:00Z)
• Public-key encryption from a trapdoor one-way embedding of $SL_2(\mathbb{N}$) [0.04662017507844856]
  We obfuscate words of a given length in a free monoid on two generators with a simple factorization algorithm to create a public-key encryption scheme. We provide a reference implementation in Python and suggested parameters.
  arXiv  Detail & Related papers  (2024-09-11T20:58:11Z)
• Two RSA-based Cryptosystems [0.0]
  The cryptosystem RSA is a very popular cryptosystem in the study of Cryptography. In this article, we explore how the idea of a primitive mth root of unity in a ring can be integrated into the Discrete Fourier Transform.
  arXiv  Detail & Related papers  (2024-05-17T18:35:29Z)
• Notes on Small Private Key Attacks on Common Prime RSA [0.0]
  We point out critical deficiencies in lattice-based cryptanalysis of common prime RSA presented in this paper. We offer an illustration of small private key attacks on common prime RSA.
  arXiv  Detail & Related papers  (2023-10-19T08:27:18Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• Demystifying the RSA Algorithm: An Intuitive Introduction for Novices in Cybersecurity [0.0]
  The RSA algorithm is a crucial component in public-key cryptosystems. understanding the RSA algorithm typically entails familiarity with number theory, modular arithmetic, and related concepts. We present an intuitively crafted, student-oriented introduction to the RSA algorithm.
  arXiv  Detail & Related papers  (2023-08-05T04:20:18Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00: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)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• Recovering AES Keys with a Deep Cold Boot Attack [91.22679787578438]
  Cold boot attacks inspect the corrupted random access memory soon after the power has been shut down. In this work, we combine a novel cryptographic variant of a deep error correcting code technique with a modified SAT solver scheme to apply the attack on AES keys. Our results show that our methods outperform the state of the art attack methods by a very large margin.
  arXiv  Detail & Related papers  (2021-06-09T07:57:01Z)
• Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
  Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
  arXiv  Detail & Related papers  (2020-06-17T18:14:30Z)

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.