Pages that link to "Item:Q5459084"

The following pages link to A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants (Q5459084):

Displaying 39 items.

• Cryptanalysis of Dual RSA (Q517262) (← links)
• A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA (Q966349) (← links)
• Cryptanalysis of RSA with two decryption exponents (Q991745) (← links)
• Cryptanalysis of RSA with more than one decryption exponent (Q991798) (← links)
• A generalized attack on some variants of the RSA cryptosystem (Q1726690) (← links)
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound (Q1727391) (← links)
• On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
• The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
• Cryptanalytic results on `Dual CRT' and `Common Prime' RSA (Q1934238) (← links)
• Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA (Q1998906) (← links)
• Small CRT-exponent RSA revisited (Q2010590) (← links)
• Classical attacks on a variant of the RSA cryptosystem (Q2146087) (← links)
• Attacks on pseudo random number generators hiding a linear structure (Q2152156) (← links)
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents (Q2170085) (← links)
• Fast rebalanced RSA signature scheme with typical prime generation (Q2182709) (← links)
• Inferring sequences produced by elliptic curve generators using Coppersmith's methods (Q2182710) (← links)
• Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents (Q2202020) (← links)
• Cryptanalysis of the RSA variant based on cubic Pell equation (Q2232613) (← links)
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017 (Q2291665) (← links)
• Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices (Q2666752) (← links)
• Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
• Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods (Q2817871) (← links)
• On the Security of Supersingular Isogeny Cryptosystems (Q2958115) (← 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)
• Partial Key Exposure: Generalized Framework to Attack RSA (Q3104725) (← links)
• Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
• Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization (Q3454586) (← links)
• On the security of multi-prime RSA (Q3537519) (← links)
• Combined Attack on CRT-RSA (Q4916010) (← links)
• Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
• (Q5076805) (← links)
• Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
• Small CRT-Exponent RSA Revisited (Q5738972) (← links)
• A Unified Method for Private Exponent Attacks on RSA Using Lattices (Q5859736) (← links)
• Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
• Partial prime factor exposure attacks on some RSA variants (Q6496879) (← links)