scientific article; zbMATH DE number 1418303
From MaRDI portal
Publication:4941863
Recommendations
Cited in
(35)- Iterative root approximation in \(p\)-adic numerical analysis
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- A new public key cryptosystem based on Edwards curves
- New number-theoretic cryptographic primitives
- A deterministic algorithm for finding \(r\)-power divisors
- Classical attacks on a variant of the RSA cryptosystem
- Improved factorization of \(N=p^rq^s\)
- Revisiting prime power RSA
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Factoring N=p^rq^s for Large r and s
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- New Attacks on RSA with Moduli N = p r q
- Sufficient conditions for factoring a class of large integers
- New weak keys in RSA
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Factoring with Cyclotomic Polynomials
- Small secret exponent attack on RSA variant with modulus N=p^rq
- A method for obtaining digital signatures and public-key cryptosystems
- Smallest Reduction Matrix of Binary Quadratic Forms
- Cryptanalysis of Prime Power RSA with two private exponents
- Exploiting the security of N= p^r q^s through approximation of (N)
- Using LLL-reduction for solving RSA and factorization problems
- Computing prime divisors in an interval
- Finding smooth integers in short intervals using CRT decoding
- Deterministic factoring with oracles
- Revisiting RSA-polynomial problem and semiprime factorization
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Fast square-free decomposition of integers using class groups
- A more complete cryptanalysis of the RSA-polynomial problem
- Revisiting Takagi-Lim et al. family schemes
- A new public key encryption scheme based on the cubic Pell curve using encoding functions
- A new public key cryptosystem based on the cubic Pell curve
- A new generalization of the KMOV cryptosystem
- Factoring multi power RSA moduli with a class of secret exponents
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941863)
