Cryptanalysis of the RSA variant based on cubic Pell equation
From MaRDI portal
Publication:2232613
DOI10.1016/j.tcs.2021.08.001OpenAlexW3189535762MaRDI QIDQ2232613
Yuanzhi Yao, Noboru Kunihiro, Mengce Zheng
Publication date: 6 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.001
Related Items
Improving small private exponent attack on the Murru-Saettone cryptosystem ⋮ Continued fractions applied to a family of RSA-like cryptosystems ⋮ Further cryptanalysis of a type of RSA variants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of RSA variants with modified Euler quotient
- A generalized attack on RSA type cryptosystems
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Small CRT-exponent RSA revisited
- The Wiener attack on RSA revisited: a quest for the exact bound
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Generalized cryptanalysis of small CRT-exponent RSA
- A novel RSA-like cryptosystem based on a generalization of the Rédei rational functions
- How to Generalize RSA Cryptanalyses
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- Finding a Small Root of a Univariate Modular Equation
- Cryptanalysis of short RSA secret exponents
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree
- Cryptanalysis of Prime Power RSA with two private exponents
- Cryptanalysis of RSA with Multiple Small Secret Exponents
- Using LLL-Reduction for Solving RSA and Factorization Problems
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
