Pages that link to "Item:Q2876895"
From MaRDI portal
The following pages link to Finding a Small Root of a Univariate Modular Equation (Q2876895):
Displaying 50 items.
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017) (← 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)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← 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)
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures (Q2040024) (← 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)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← 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)
- Generalized cryptanalysis of small CRT-exponent RSA (Q2330126) (← links)
- A new parallel lattice reduction algorithm for BKZ reduced bases (Q2335926) (← links)
- Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← links)
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients (Q2370640) (← links)
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices (Q2666752) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs (Q2817816) (← links)
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods (Q2817871) (← links)
- A Unified Framework for Small Secret Exponent Attack on RSA (Q2889876) (← links)
- A New Partial Key Exposure Attack on Multi-power RSA (Q2947151) (← links)
- A Tool Kit for Partial Key Exposure Attacks on RSA (Q2975796) (← links)
- Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial (Q2980866) (← links)
- Applications of Signcryption (Q3000039) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- A small secret exponent attack on cryptosystems using Dickson polynomials (Q3121388) (← links)
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem (Q3297646) (← links)
- On the security of multi-prime RSA (Q3537519) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- A method for obtaining digital signatures and public-key cryptosystems (Q4145254) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- Combined Attack on CRT-RSA (Q4916010) (← links)
- Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)
- Cryptanalysis of Prime Power RSA with two private exponents (Q5046479) (← links)
- Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem (Q5095931) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance (Q5188548) (← links)
- RSA Moduli with a Predetermined Portion: Techniques and Applications (Q5458502) (← links)
- Computing prime divisors in an interval (Q5497026) (← links)
- Small CRT-Exponent RSA Revisited (Q5738972) (← links)
- Practical attacks on small private exponent RSA: new records and new insights (Q6070359) (← links)
- The multi-variable modular polynomial and its applications to cryptography (Q6487458) (← links)
- HS-based error correction algorithm for noisy binary GCD side-channel sequences (Q6535072) (← links)
- Finding small roots for bivariate polynomials over the ring of integers (Q6556570) (← links)
- Improved Herrmann-May's attack with merging variables and lower LLL bound (Q6575047) (← links)
