Cryptanalysis of some algebraic variants of the RSA cryptosystem
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A new generalization of the KMOV cryptosystem
- A security analysis of two classes of RSA-like cryptosystems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- An improved analysis on three variants of the RSA cryptosystem
- Another Generalization of Wiener’s Attack on RSA
- Attack on RSA-type cryptosystems based on singular cubic curves over \(\mathbb{Z}/n\mathbb{Z}\)
- Cryptanalysis of a new variant of the RSA cryptosystem
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of the RSA variant based on cubic Pell equation
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 176555 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- On optimal bounds of small inverse problems and approximate GCD problems with higher degree
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- RSA cryptosystem for Dedekind rings
- RSA cryptosystem for rings with commuting ideals
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
This page was built for publication: Cryptanalysis of some algebraic variants of the RSA cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887496)