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.
- Revisiting prime power RSA (Q260044) (← links)
- An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics (Q268490) (← links)
- (EC)DSA lattice attacks based on Coppersmith's method (Q280950) (← links)
- Factoring multi-power RSA moduli with primes sharing least or most significant bits (Q285897) (← links)
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\) (Q398942) (← links)
- On the modular inversion hidden number problem (Q412197) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Some lattice attacks on DSA and ECDSA (Q429782) (← links)
- On reducing factorization to the discrete logarithm problem modulo a composite (Q445245) (← links)
- Cryptanalysis of Dual RSA (Q517262) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Trapdoor DDH groups from pairings and isogenies (Q832364) (← links)
- A quasi quadratic time algorithm for hyperelliptic curve point counting (Q874910) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Factoring multi power RSA moduli with a class of secret exponents (Q907002) (← 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)
- Efficient public key encryption with smallest ciphertext expansion from factoring (Q1009067) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- The better bound of private key in RSA with unbalanced primes (Q1406195) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- The multi-dimension RSA and its low exponent security (Q1589779) (← links)
- Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction (Q1630230) (← links)
- Factoring RSA moduli with primes sharing bits in the middle (Q1647745) (← links)
- A generalized attack on RSA type cryptosystems (Q1680536) (← links)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017) (← 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 security of RSA with primes sharing least-significant bits (Q1762562) (← links)
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA (Q1934238) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- A new public key cryptosystem based on Edwards curves (Q2008069) (← links)
- Small CRT-exponent RSA revisited (Q2010590) (← links)
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem (Q2025379) (← links)
- A deterministic algorithm for finding \(r\)-power divisors (Q2093686) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Classical attacks on a variant of the RSA cryptosystem (Q2146087) (← links)
- Cryptanalysis of RSA variants with primes sharing most significant bits (Q2154038) (← links)
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents (Q2170085) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Fast rebalanced RSA signature scheme with typical prime generation (Q2182709) (← 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 RSA for a special case with \(d > e\) (Q2267091) (← links)
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017 (Q2291665) (← links)
- Generalized cryptanalysis of small CRT-exponent RSA (Q2330126) (← links)
- Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← links)
- A note on the bivariate Coppersmith theorem (Q2377067) (← links)
- Acoustic cryptanalysis (Q2397444) (← links)
