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

No abstract is available for this paper.

• Publication year

  2024

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-031-82380-0_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Case of Small Prime Numbers Versus the Joye-Libert Cryptosystem

  2022cited by this paper
• A New Generalisation of the Goldwasser-Micali Cryptosystem Based on the Gap 2k-Residuosity Assumption

  2020cited by this paper
• Recommendation for key management:

  2019cited by this paper
• Guess

  2018cited by this paper
• Handbook of Applied Cryptography

  2018cited by this paper
• RSA Factoring Challenge

  2011cited by this paper
• Number Theory Meets Cache Locality – Efficient Implementation of a Small Prime FFT for the GNU Multiple Precision Arithmetic Library

  2005cited by this paper
• On the Security of a Modified Paillier Public-Key Primitive

  2002cited by this paper
• Prime numbers: A computational perspective

  2002cited by this paper
• Improvement of Probabilistic Public Key Cryptosystems Using Discrete Logarithm

  2001cited by this paper
• Unbelievable Security. Matching AES Security Using Public Key Systems

  2001cited by this paper
• Selecting Cryptographic Key Sizes

  2000cited by this paper
• A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths RSA Labs bulletin

  2000cited by this paper
• A Generalized Takagi-Cryptosystem with a modulus of the form prqs

  2000cited by this paper
• Some Parallel Algorithms for Integer Factorisation

  1999cited by this paper
• Accelerating Okamoto-Uchiyama public-key cryptosystem

  1999influential reference
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• A New Public-Key Cryptosystem as Secure as Factoring

  1998influential reference
• Chinese remainder theorem: applications in computing, coding, cryptography

  1996cited by this paper
• Factoring integers with elliptic curves

  1987cited by this paper

• Revisiting Takagi-Lim et al. family schemes

  2026cites this paper