Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311534
Recommendations
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
- Factoring multi power RSA moduli with a class of secret exponents
- scientific article; zbMATH DE number 562223
- CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
Cited in
(13)- Decoding RSA public-key cryptosystem by algorithmic self-assembly
- Breaking RSA may be as difficult as factoring
- Partial key exposure attacks on RSA with multiple exponent pairs
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- Partial key exposure attack on short secret exponent CRT-RSA
- Breaking RSA Generically Is Equivalent to Factoring
- Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
- Using LLL-reduction for solving RSA and factorization problems
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Signcryption Schemes Based on the RSA Problem
- Fast rebalanced RSA signature scheme with typical prime generation
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
This page was built for publication: Advances in Cryptology – CRYPTO 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311534)
