On the public citation graph

Finding small roots of univariate modular equations revisited

https://doi.org/10.1007/bfb0024458
0 signed · 307 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-68339-9_14openalex-snapshot
Finding a Small Root of a Univariate Modular Equation
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/11426639_15openalex-snapshot
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
inferred← citeshttps://doi.org/10.1007/11426639_22openalex-snapshot
Partial Key Exposure Attacks on RSA up to Full Size Exponents
inferred← citeshttps://doi.org/10.1007/11506157_24openalex-snapshot
Tunable Balancing of RSA
inferred← citeshttps://doi.org/10.1007/11605805_6openalex-snapshot
Another Look at Small RSA Exponents
inferred← citeshttps://doi.org/10.1007/11745853_1openalex-snapshot
New Attacks on RSA with Small Secret CRT-Exponents
inferred← citeshttps://doi.org/10.1007/11761679_15openalex-snapshot
Symplectic Lattice Reduction and NTRU
inferred← citeshttps://doi.org/10.1007/11935230_13openalex-snapshot
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
inferred← citeshttps://doi.org/10.1007/11935230_18openalex-snapshot
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
inferred← citeshttps://doi.org/10.1007/11958239_8openalex-snapshot
Factorization of Square-Free Integers with High Bits Known
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_25openalex-snapshot
On Some Attacks on Multi-prime RSA
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_2openalex-snapshot
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’99
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_2openalex-snapshot
Low Secret Exponent RSA Revisited
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_3openalex-snapshot
Finding Small Solutions to Small Degree Polynomials
inferred← citeshttps://doi.org/10.1007/3-540-45325-3_29openalex-snapshot
Lattice Attacks on RSA-Encrypted IP and TCP
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_3openalex-snapshot
The Modular Inversion Hidden Number Problem
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_16openalex-snapshot
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_21openalex-snapshot
Factoring N = p r q for Large r
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_1openalex-snapshot
Cryptanalysis of RSA with Private Key d Less than N 0.292
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_16openalex-snapshot
The Effectiveness of Lattice Attacks Against Low-Exponent RSA
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_35openalex-snapshot
Certifying Variant of RSA with Generalized Moduli
inferred← citeshttps://doi.org/10.1007/978-3-030-10970-7_19openalex-snapshot
A Generalized Attack on Some Variants of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_11openalex-snapshot
New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator
inferred← citeshttps://doi.org/10.1007/978-3-030-29563-9_21openalex-snapshot
Practical Scheme for Secure Outsourcing of Coppersmith’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-31578-8_29openalex-snapshot
Implicit Related-Key Factorization Problem on the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-31919-9_12openalex-snapshot
Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-34637-9_26openalex-snapshot
Implicit-Key Attack on the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-88238-9_8openalex-snapshot
Classical Attacks on a Variant of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-91356-4_3openalex-snapshot
Cryptanalysis of RSA Variants with Primes Sharing Most Significant Bits
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_4openalex-snapshot
Partial Key Exposure Attack on Short Secret Exponent CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-031-15777-6_3openalex-snapshot
New Results of Breaking the CLS Scheme from ACM-CCS 2014
inferred← citeshttps://doi.org/10.1007/978-3-031-17433-9_23openalex-snapshot
A Generalized Attack on the Multi-prime Power RSA
inferred← citeshttps://doi.org/10.1007/978-3-031-17510-7_3openalex-snapshot
Attack on the Common Prime Version of Murru and Saettone’s RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-031-19685-0_6openalex-snapshot
Finding Points on Elliptic Curves with Coppersmith’s Method
inferred← citeshttps://doi.org/10.1007/978-3-031-20974-1_12openalex-snapshot
Cryptanalysis of the Multi-Power RSA Cryptosystem Variant
inferred← citeshttps://doi.org/10.1007/978-3-031-22390-7_9openalex-snapshot
Further Cryptanalysis of a Type of RSA Variants
inferred← citeshttps://doi.org/10.1007/978-3-031-22969-5_26openalex-snapshot
Improving Bounds on Elliptic Curve Hidden Number Problem for ECDH Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_18openalex-snapshot
A Third is All You Need: Extended Partial Key Exposure Attack on CRT-RSA with Additive Exponent Blinding
inferred← citeshttps://doi.org/10.1007/978-3-031-26553-2_26openalex-snapshot
Inferring Sequences Produced by the Quadratic Generator
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_7openalex-snapshot
Caveat Implementor! Key Recovery Attacks on MEGA
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_6openalex-snapshot
The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_11openalex-snapshot
Improved Cryptanalysis of the Multi-Power RSA Cryptosystem Variant
inferred← citeshttps://doi.org/10.1007/978-3-031-38548-3_1openalex-snapshot
Fast Practical Lattice Reduction Through Iterated Compression
inferred← citeshttps://doi.org/10.1007/978-3-031-53368-6_18openalex-snapshot
Generalized Implicit Factorization Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-64381-1_15openalex-snapshot
Cryptanalysis of a New Variant of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-031-66997-2_8openalex-snapshot
Formalizing Coppersmith’s Method in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_8openalex-snapshot
Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-031-80311-6_10openalex-snapshot
Enhanced Bound for the Commutative Isogeny Hidden Number Problem in CSURF
inferred← citeshttps://doi.org/10.1007/978-3-031-87760-5_16openalex-snapshot
Another Lattice Attack Against an RSA-Like Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-031-91095-1_13openalex-snapshot
Solving Multivariate Coppersmith Problems with Known Moduli
inferred← citeshttps://doi.org/10.1007/978-3-031-95761-1_19openalex-snapshot
Key Recovery Attacks on Unpatched MEGA from Four Queries: Solving Approximate Divisor Problem with Help of Approximation of Squared Divisor
inferred← citeshttps://doi.org/10.1007/978-3-031-97260-7_5openalex-snapshot
A Novel Partial Key Exposure Attack on Common Prime RSA
inferred← citeshttps://doi.org/10.1007/978-3-031-97260-7_6openalex-snapshot
Improved Cryptanalysis of an RSA Variant Based on Cubic Pell Curve
inferred← citeshttps://doi.org/10.1007/978-3-031-97260-7_7openalex-snapshot
A New Generalized Attack on RSA-Like Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_1openalex-snapshot
Computing Asymptotic Bounds for Small Roots in Coppersmith’s Method via Sumset Theory
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_2openalex-snapshot
New Results on the $$\phi $$-Hiding Assumption and Factoring Related RSA Moduli
inferred← citeshttps://doi.org/10.1007/978-3-032-10759-6_4openalex-snapshot
A Generalized Wiener-Type Attack Against an RSA-Like Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-032-14782-0_3openalex-snapshot
Attacking an RSA-Like Cryptosystem Using Continued Fractions and Lattices
inferred← citeshttps://doi.org/10.1007/978-3-032-22931-1_4openalex-snapshot
SoK: A Generalized Attack on RSA and Its Variants
inferred← citeshttps://doi.org/10.1007/978-3-032-25327-9_19openalex-snapshot
Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith’s Method
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_15openalex-snapshot
On the Dangers of RSA Exponent Transforms
inferred← citeshttps://doi.org/10.1007/978-3-032-26740-5_15openalex-snapshot
A Novel Leakage Model in OpenSSL’s Miller-Rabin Primality Test
inferred← citeshttps://doi.org/10.1007/978-3-032-31130-6_13openalex-snapshot
A New Attack on an RSA Variant with Primes Sharing Most Significant Bits
inferred← citeshttps://doi.org/10.1007/978-3-032-32764-2_24openalex-snapshot
Vulnerability Analysis of Mersenne Number-Based Post-quantum Cryptosystems in Secure Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-01766-2_30openalex-snapshot
Implicit Factoring with Shared Middle Discrete Bits
inferred← citeshttps://doi.org/10.1007/978-3-319-06320-1_39openalex-snapshot
Modular Inversion Hidden Number Problem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_11openalex-snapshot
Further Improvement of Factoring RSA Moduli with Implicit Hint
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_12openalex-snapshot
New Attacks on the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_10openalex-snapshot
New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_9openalex-snapshot
Partial Key Exposure Attacks on Takagi’s Variant of RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-08344-5_12openalex-snapshot
Cryptanalysis of RSA with Multiple Small Secret Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_15openalex-snapshot
Partial Key Exposure Attack on CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-13051-4_21openalex-snapshot
Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
inferred← citeshttps://doi.org/10.1007/978-3-319-15943-0_1openalex-snapshot
General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-16745-9_12openalex-snapshot
Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
inferred← citeshttps://doi.org/10.1007/978-3-319-17533-1_7openalex-snapshot
Partial Prime Factor Exposure Attacks on RSA and Its Takagi’s Variant
inferred← citeshttps://doi.org/10.1007/978-3-319-22425-1_5openalex-snapshot
Implicit Factorization of RSA Moduli Revisited (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_10openalex-snapshot
A New Partial Key Exposure Attack on Multi-power RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_6openalex-snapshot
Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-28166-7_25openalex-snapshot
Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-29485-8_26openalex-snapshot
Factoring $$N=p^rq^s$$ for Large r and s
inferred← citeshttps://doi.org/10.1007/978-3-319-30222-5_17openalex-snapshot
Partial Key Exposure Attacks on RSA with Exponent Blinding
inferred← citeshttps://doi.org/10.1007/978-3-319-31301-6_26openalex-snapshot
Towards Optimal Bounds for Implicit Factorization Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-38898-4_11openalex-snapshot
Recovering a Sum of Two Squares Decomposition Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-40367-0_15openalex-snapshot
Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
inferred← citeshttps://doi.org/10.1007/978-3-319-45744-4_13openalex-snapshot
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
inferred← citeshttps://doi.org/10.1007/978-3-319-45871-7_3openalex-snapshot
Partial Key Exposure Attacks on CRT-RSA: General Improvement for the Exposed Least Significant Bits
inferred← citeshttps://doi.org/10.1007/978-3-319-52153-4_4openalex-snapshot
A Tool Kit for Partial Key Exposure Attacks on RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-53177-9_15openalex-snapshot
Improved Results on Cryptanalysis of Prime Power RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_22openalex-snapshot
Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_9openalex-snapshot
An Improved Analysis on Three Variants of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_5openalex-snapshot
Small CRT-Exponent RSA Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-60055-0_17openalex-snapshot
Improved Factoring Attacks on Multi-prime RSA with Small Prime Difference
inferred← citeshttps://doi.org/10.1007/978-3-319-71045-7_18openalex-snapshot
Lattice Attacks on Pairing-Based Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-76620-1_5openalex-snapshot
Short Solutions to Nonlinear Systems of Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-89339-6_15openalex-snapshot
Cryptanalysis of RSA Variants with Modified Euler Quotient
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_29openalex-snapshot
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_13openalex-snapshot
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_2openalex-snapshot
New Partial Key Exposure Attacks on RSA
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_13openalex-snapshot
On the Design of RSA with Short Secret Exponent
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_12openalex-snapshot
Another Generalization of Wiener’s Attack on RSA
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_27openalex-snapshot
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_21openalex-snapshot
Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_21openalex-snapshot
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_22openalex-snapshot
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_9openalex-snapshot
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
inferred← citeshttps://doi.org/10.1007/978-3-540-75496-1_15openalex-snapshot
Small Private-Exponent Attack on RSA with Primes Sharing Bits
inferred← citeshttps://doi.org/10.1007/978-3-540-79263-5_25openalex-snapshot
Small Secret Key Attack on a Variant of RSA (Due to Takagi)
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_25openalex-snapshot
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
inferred← citeshttps://doi.org/10.1007/978-3-540-89641-8_4openalex-snapshot
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_3openalex-snapshot
A New Lattice Construction for Partial Key Exposure Attack for RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-00730-9_3openalex-snapshot
Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_29openalex-snapshot
Partial Key Exposure Attack on CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_10openalex-snapshot
Using LLL-Reduction for Solving RSA and Factorization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04138-9_31openalex-snapshot
Fault Attacks on RSA Signatures with Partially Unknown Messages
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7openalex-snapshot
Advances in cryptology - ASIACRYPT 2009 : 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_14openalex-snapshot
Hedged Public-Key Encryption: How to Protect against Bad Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_28openalex-snapshot
Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_6openalex-snapshot
Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_4openalex-snapshot
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-13708-2_1openalex-snapshot
On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_16openalex-snapshot
Solving Generalized Small Inverse Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-16342-5_20openalex-snapshot
Weak Keys in RSA with Primes Sharing Least Significant Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-21969-6_6openalex-snapshot
Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-25405-5_13openalex-snapshot
Simplified High-Speed High-Distance List Decoding for Alternant Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25578-6_7openalex-snapshot
Partial Key Exposure: Generalized Framework to Attack RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-27299-8_55openalex-snapshot
Lattice Based Tools for Cryptanalysis in Various Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-28496-0_16openalex-snapshot
A Unified Framework for Small Secret Exponent Attack on RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-29101-2_25openalex-snapshot
Partial Key Exposure on RSA with Private Exponents Larger Than N
inferred← citeshttps://doi.org/10.1007/978-3-642-29694-9_7openalex-snapshot
Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_36openalex-snapshot
Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_14openalex-snapshot
A New Attack on RSA and CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_28openalex-snapshot
On the Optimality of Lattices for the Coppersmith Technique
inferred← citeshttps://doi.org/10.1007/978-3-642-33383-5_4openalex-snapshot
On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree
inferred← citeshttps://doi.org/10.1007/978-3-642-34159-5_9openalex-snapshot
RSA Vulnerabilities with Small Prime Difference
inferred← citeshttps://doi.org/10.1007/978-3-642-34416-9_10openalex-snapshot
Reduction in Lossiness of RSA Trapdoor Permutation
inferred← citeshttps://doi.org/10.1007/978-3-642-36362-7_13openalex-snapshot
Combined Attack on CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-38553-7_17openalex-snapshot
An Attack on RSA Using LSBs of Multiples of the Prime Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-38631-2_29openalex-snapshot
Factoring RSA Modulus with Known Bits from Both p and q: A Lattice Method
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_4openalex-snapshot
Attacks on Multi-Prime RSA with Small Prime Difference
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_5openalex-snapshot
Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_7openalex-snapshot
Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_9openalex-snapshot
Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
inferred← citeshttps://doi.org/10.1007/978-3-642-45204-8_26openalex-snapshot
Error Correction of Partially Exposed RSA Private Keys from MSB Side
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_11openalex-snapshot
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
inferred← citeshttps://doi.org/10.1007/978-3-662-43799-5_3openalex-snapshot
Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_9openalex-snapshot
Solving Linear Equations Modulo Unknown Divisors: Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_3openalex-snapshot
Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_4openalex-snapshot
How to Generalize RSA Cryptanalyses
inferred← citeshttps://doi.org/10.1007/978-3-662-53887-6_28openalex-snapshot
Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials
inferred← citeshttps://doi.org/10.1007/978-81-322-1771-8_70openalex-snapshot
Cryptanalytic Attacks and Countermeasures on RSA
inferred← citeshttps://doi.org/10.1007/978-981-10-5065-7_16openalex-snapshot
Recent Progress on Coppersmith’s Lattice-Based Method: A Survey
inferred← citeshttps://doi.org/10.1007/978-981-13-7123-3_34openalex-snapshot
A Method for Solving Generalized Implicit Factorization Problem
inferred← citeshttps://doi.org/10.1007/978-981-96-1218-5_9openalex-snapshot
Full Key Recovery on RSA from Noisy Binary GCD Operation Sequences
inferred← citeshttps://doi.org/10.1007/978-981-96-4734-7_4openalex-snapshot
Generalized Cryptanalysis of Cubic Pell RSA
inferred← citeshttps://doi.org/10.1007/978-981-96-9098-5_16openalex-snapshot
Solving Generalized Approximate Divisor Multiples Problems
inferred← citeshttps://doi.org/10.1007/978-981-96-9101-2_24openalex-snapshot
Improving RSA Cryptanalysis: Combining Continued Fractions and Coppersmith’s Techniques
inferred← citeshttps://doi.org/10.1007/978-981-97-0945-8_12openalex-snapshot
Improved Herrmann-May’s Attack with Merging Variables and Lower LLL Bound
inferred← citeshttps://doi.org/10.1007/978-981-97-5028-3_10openalex-snapshot
Improved Lattice-Based Attack on Mersenne Low Hamming Ratio Search Problem
inferred← citeshttps://doi.org/10.1007/bfb0054124openalex-snapshot
On finding small solutions of modular multivariate polynomial equations
inferred← citeshttps://doi.org/10.1007/s00145-006-0433-6openalex-snapshot
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
inferred← citeshttps://doi.org/10.1007/s00145-018-9282-3openalex-snapshot
Small CRT-Exponent RSA Revisited
inferred← citeshttps://doi.org/10.1007/s00145-026-09577-6openalex-snapshot
New Results on Elliptic Curve Hidden Number Problem for ECDH Key Exchange
inferred← citeshttps://doi.org/10.1007/s00200-011-0154-4openalex-snapshot
Some lattice attacks on DSA and ECDSA
inferred← citeshttps://doi.org/10.1007/s00200-017-0336-9openalex-snapshot
On the optimality of lattices for the coppersmith technique
inferred← citeshttps://doi.org/10.1007/s00200-021-00521-8openalex-snapshot
Deterministic factoring with oracles
inferred← citeshttps://doi.org/10.1007/s002000100088openalex-snapshot
Cryptanalysis of RSA with Small Prime Difference
inferred← citeshttps://doi.org/10.1007/s00453-020-00750-2openalex-snapshot
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
inferred← citeshttps://doi.org/10.1007/s10623-007-9112-3openalex-snapshot
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
inferred← citeshttps://doi.org/10.1007/s10623-012-9675-5openalex-snapshot
Cryptanalytic results on ‘Dual CRT’ and ‘Common Prime’ RSA
inferred← citeshttps://doi.org/10.1007/s10623-013-9803-xopenalex-snapshot
List decoding of number field codes
inferred← citeshttps://doi.org/10.1007/s10623-014-9928-6openalex-snapshot
Small secret exponent attack on RSA variant with modulus $$N=p^rq$$ N = p r q
inferred← citeshttps://doi.org/10.1007/s10623-016-0196-5openalex-snapshot
Cryptanalysis of Dual RSA
inferred← citeshttps://doi.org/10.1007/s10623-017-0435-4openalex-snapshot
Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
inferred← citeshttps://doi.org/10.1007/s10623-019-00685-yopenalex-snapshot
Cryptanalysis of elliptic curve hidden number problem from PKC 2017
inferred← citeshttps://doi.org/10.1007/s10623-024-01554-zopenalex-snapshot
Fault attacks on multi-prime RSA signatures
inferred← citeshttps://doi.org/10.1007/s11042-021-11335-8openalex-snapshot
Exponential increment of RSA attack range via lattice based cryptanalysis
inferred← citeshttps://doi.org/10.1007/s11227-024-06478-yopenalex-snapshot
An optimal bound for factoring unbalanced RSA moduli by solving Generalized Implicit Factorization Problem
inferred← citeshttps://doi.org/10.1007/s11390-008-9123-1openalex-snapshot
Cryptanalysis of a Type of CRT-Based RSA Algorithms
inferred← citeshttps://doi.org/10.1007/s11416-020-00363-xopenalex-snapshot
Embedding asymmetric backdoors into the RSA key generator
inferred← citeshttps://doi.org/10.1007/s11416-023-00508-8openalex-snapshot
Cryptanalysis of RSA with composed decryption exponent with few most significant bits of one of the primes
inferred← citeshttps://doi.org/10.1007/s11432-009-0014-zopenalex-snapshot
Cryptanalysis of RSA for a special case with d >e
inferred← citeshttps://doi.org/10.1007/s11432-015-5325-7openalex-snapshot
Generalized cryptanalysis of RSA with small public exponent
inferred← citeshttps://doi.org/10.1007/s11432-015-5409-4openalex-snapshot
Cryptanalysis of Prime Power RSA with two private exponents
inferred← citeshttps://doi.org/10.1007/s11432-017-9176-5openalex-snapshot
A better bound for implicit factorization problem with shared middle bits
inferred← citeshttps://doi.org/10.1007/s12190-024-02292-0openalex-snapshot
Further cryptanalysis of some variants of the RSA cryptosystem
inferred← citeshttps://doi.org/10.1007/s13389-025-00383-7openalex-snapshot
New lattice-based partial key exposure attacks on common prime RSA
inferred← citeshttps://doi.org/10.1007/s40314-025-03392-8openalex-snapshot
A generalized attack on a new variant of the RSA cryptosystem
inferred← citeshttps://doi.org/10.1016/j.csi.2021.103584openalex-snapshot
Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.003openalex-snapshot
Revisiting Prime Power RSA
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.075openalex-snapshot
Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.11.016openalex-snapshot
Cryptanalysis of RSA with two decryption exponents
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.002openalex-snapshot
Reconstructing noisy polynomial evaluation in residue rings
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.04.006openalex-snapshot
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
inferred← citeshttps://doi.org/10.1016/j.jnt.2021.01.002openalex-snapshot
Coppersmith's lattices and “focus groups”: An attack on small-exponent RSA
inferred← citeshttps://doi.org/10.1016/j.jss.2009.04.001openalex-snapshot
Trading decryption for speeding encryption in Rebalanced-RSA
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.021openalex-snapshot
Partial key exposure attacks on RSA: Achieving the Boneh–Durfee bound
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.031openalex-snapshot
Generalized cryptanalysis of small CRT-exponent RSA
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.004openalex-snapshot
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents
showing the first 200 of 303 · page through all 303
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.