On the public citation graph

On finding small solutions of modular multivariate polynomial equations

https://doi.org/10.1007/bfb0054124
0 signed · 43 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-46766-1_20openalex-snapshot
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
inferredcites →https://doi.org/10.1007/3-540-68339-9_1openalex-snapshot
Low-Exponent RSA with Related Messages
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/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bfb0024458openalex-snapshot
Finding small roots of univariate modular equations revisited
inferredcites →https://doi.org/10.1007/bfb0052239openalex-snapshot
On the security of the KMOV public key cryptosystem
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems

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/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-45708-9_16openalex-snapshot
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
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-0-387-35528-3_16openalex-snapshot
Biometrics, Access Control, Smart Cards: A Not So Simple Combination
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_12openalex-snapshot
Instantiability of Classical Random-Oracle-Model Encryption Transforms
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-57718-5_12openalex-snapshot
On the Possibility of a Backdoor in the Micali-Schnorr Generator
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-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-76620-1_5openalex-snapshot
Short Solutions to Nonlinear Systems of Equations
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-45146-4_2openalex-snapshot
New Partial Key Exposure Attacks on RSA
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-642-02295-1_10openalex-snapshot
Using LLL-Reduction for Solving RSA and Factorization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_29openalex-snapshot
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
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/s00200-021-00521-8openalex-snapshot
Deterministic factoring with oracles
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/s11432-009-0014-zopenalex-snapshot
Cryptanalysis of RSA for a special case with d >e
inferred← citeshttps://doi.org/10.1016/j.amc.2004.10.082openalex-snapshot
Cryptanalysis of large RSA exponent by using the LLL algorithm
inferred← citeshttps://doi.org/10.1109/18.850673openalex-snapshot
Cryptanalysis of RSA with private key d less than N/sup 0.292/
inferred← citeshttps://doi.org/10.1360/zf2009-39-8-815openalex-snapshot
对RSA公钥密码系统在d>e时的一种特殊情形的密码学分析
inferred← citeshttps://doi.org/10.1515/jmc-2025-0020openalex-snapshot
Distribution of powers modulo p and security of RSA
inferred← citeshttps://doi.org/10.18642/jmsaa_7100121630openalex-snapshot
A STUDY OF SOME METHODS FOR FINDING SMALL ZEROS OF POLYNOMIAL CONGRUENCES APPLIED TO RSA
inferred← citeshttps://doi.org/10.2140/obs.2013.1.271openalex-snapshot
Approximate common divisors via lattices
inferred← citeshttps://doi.org/10.23939/mmc2024.04.1135openalex-snapshot
An attack on ELG-LUC3-ECC cryptosystem using Hastad's and Julta's theorem
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.17openalex-snapshot
Approximating the Number of Prime Factors Given an Oracle to Euler’s Totient Function
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00987openalex-snapshot
A practical attack to Bouftass's cryptosystem
inferred← citeshttps://doi.org/10.70675/856726a5z3d79z450cz8920z5ae6dc87f10eopenalex-snapshot
Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures
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.