scientific article; zbMATH DE number 1182510
From MaRDI portal
Publication:4400575
zbMath0922.11113MaRDI QIDQ4400575
Publication date: 3 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (81)
A Unified Framework for Small Secret Exponent Attack on RSA ⋮ Cryptanalysis of Prime Power RSA with two private exponents ⋮ Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization ⋮ Classical attacks on a variant of the RSA cryptosystem ⋮ Cryptanalysis of RSA variants with primes sharing most significant bits ⋮ Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ Recovering zeros of polynomials modulo a prime ⋮ Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ Partial Key Exposure Attack on CRT-RSA ⋮ A New Partial Key Exposure Attack on Multi-power RSA ⋮ Small secret exponent attack on RSA variant with modulus \(N=p^rq\) ⋮ A new attack on some RSA variants ⋮ Cryptanalytic results on `Dual CRT' and `Common Prime' RSA ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ \textit{Caveat implementor!} Key recovery attacks on MEGA ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ A generalized attack on the multi-prime power RSA ⋮ Finding points on elliptic curves with Coppersmith's method ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ Further cryptanalysis of a type of RSA variants ⋮ Another Generalization of Wiener’s Attack on RSA ⋮ Deterministic factoring with oracles ⋮ Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials ⋮ Inferring sequences produced by the quadratic generator ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Fast practical lattice reduction through iterated compression ⋮ Partial key exposure attack on short secret exponent CRT-RSA ⋮ Cryptanalysis of the multi-power RSA cryptosystem variant ⋮ A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding ⋮ The better bound of private key in RSA with unbalanced primes ⋮ Improved cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Some lattice attacks on DSA and ECDSA ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ An Improved Analysis on Three Variants of the RSA Cryptosystem ⋮ Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Further improvement of factoring \(N=p^rq^s\) with partial known bits ⋮ A generalized attack on some variants of the RSA cryptosystem ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Finding smooth integers in short intervals using CRT decoding ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption ⋮ On the optimality of lattices for the Coppersmith technique ⋮ Cryptanalysis of Dual RSA ⋮ List decoding of number field codes ⋮ Combined Attack on CRT-RSA ⋮ Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA ⋮ A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Unnamed Item ⋮ Divisors in residue classes, constructively ⋮ Predicting nonlinear pseudorandom number generators ⋮ Cryptanalysis of RSA for a special case with \(d > e\) ⋮ Symplectic Lattice Reduction and NTRU ⋮ A method for obtaining digital signatures and public-key cryptosystems ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ Cryptanalysis of RSA with two decryption exponents ⋮ Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures ⋮ Cryptanalysis of elliptic curve hidden number problem from PKC 2017 ⋮ Towards Optimal Bounds for Implicit Factorization Problem ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Partial Key Exposure: Generalized Framework to Attack RSA ⋮ Generalized cryptanalysis of small CRT-exponent RSA ⋮ Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits ⋮ A small secret exponent attack on cryptosystems using Dickson polynomials ⋮ A Unified Method for Private Exponent Attacks on RSA Using Lattices ⋮ Revisiting prime power RSA ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey
This page was built for publication:
