Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311534
DOI10.1007/B99099zbMATH Open1104.94030OpenAlexW2477011922MaRDI QIDQ5311534FDOQ5311534
Authors: Alexander May 
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99099
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)
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
Uses Software
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)
