Pages that link to "Item:Q1382143"
From MaRDI portal
The following pages link to Small solutions to polynomial equations, and low exponent RSA vulnerabilities (Q1382143):
Displaying 50 items.
- A note on the bivariate Coppersmith theorem (Q2377067) (← links)
- Acoustic cryptanalysis (Q2397444) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Instantiability of RSA-OAEP under chosen-plaintext attack (Q2408591) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Recovering a sum of two squares decomposition (Q2437316) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- A new attack on RSA with two or three decryption exponents (Q2511362) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) (Q2628124) (← links)
- Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)'' (Q2671806) (← links)
- Improving small private exponent attack on the Murru-Saettone cryptosystem (Q2672624) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- On oracle factoring of integers (Q2693692) (← links)
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
- Towards Optimal Bounds for Implicit Factorization Problem (Q2807227) (← links)
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs (Q2817816) (← links)
- A New Attack on Three Variants of the RSA Cryptosystem (Q2817817) (← links)
- A Unified Framework for Small Secret Exponent Attack on RSA (Q2889876) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Small primitive roots and malleability of RSA moduli (Q2905219) (← links)
- Partial Key Exposure Attack on CRT-RSA (Q2945387) (← links)
- New Attacks on RSA with Moduli N = p r q (Q2947095) (← links)
- Factoring RSA Moduli with Weak Prime Factors (Q2947096) (← links)
- A New Partial Key Exposure Attack on Multi-power RSA (Q2947151) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- A Tool Kit for Partial Key Exposure Attacks on RSA (Q2975796) (← links)
- An Improved Analysis on Three Variants of the RSA Cryptosystem (Q2980851) (← links)
- Improved Results on Cryptanalysis of Prime Power RSA (Q2988352) (← links)
- Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption (Q3011906) (← links)
- Sufficient conditions for factoring a class of large integers (Q3078177) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- A small secret exponent attack on cryptosystems using Dickson polynomials (Q3121388) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem (Q3297646) (← links)
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization (Q3454586) (← links)
- New Multilinear Maps Over the Integers (Q3457114) (← links)
- Cryptanalysis of the Co-ACD Assumption (Q3457128) (← links)
- Another Generalization of Wiener’s Attack on RSA (Q3506378) (← links)
- On the security of multi-prime RSA (Q3537519) (← links)
- Revisiting Wiener’s Attack – New Weak Keys in RSA (Q3540147) (← links)
- Application of ECM to a class of RSA keys (Q3561507) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors (Q3617506) (← links)
- Cryptanalysis of RSA Using the Ratio of the Primes (Q3637134) (← links)
- Algorithm for factoring some RSA and Rabin moduli (Q3637783) (← links)
- Solving Simultaneous Modular Equations of Low Degree (Q3783957) (← links)
- A method for obtaining digital signatures and public-key cryptosystems (Q4145254) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
