Publication:4229172
From MaRDI portal
zbMath0914.94007MaRDI QIDQ4229172
Publication date: 8 March 1999
Full work available at URL: http://www.ams.org/notices/199902/199902-toc.html
94A60: Cryptography
01A65: Development of contemporary mathematics
94-03: History of information and communication theory
11Y05: Factorization
Related Items
It is easy to determine whether a given integer is prime, Unnamed Item, Using LLL-Reduction for Solving RSA and Factorization Problems, A new public key scheme based on DRSA and generalized GDLP, Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?, RSA Moduli with a Predetermined Portion: Techniques and Applications, A New Class of Weak Encryption Exponents in RSA, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Improvements in the analysis of Kannan's CVP algorithm, Breaking RSA may be as difficult as factoring, NSA and dual EC\(\_\)DRBG: Déjà vu all over again?, Small secret exponent attack on RSA variant with modulus \(N=p^rq\), Cryptanalysis of a quadratic knapsack cryptosystem, Long-term security and universal composability, On the number of sparse RSA exponents, A new generalization of the KMOV cryptosystem, On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Cryptanalysis of RSA with two decryption exponents, The better bound of private key in RSA with unbalanced primes, How to fake an RSA signature by encoding modular root finding as a SAT problem, Large decryption exponents in RSA, The multi-dimension RSA and its low exponent security, A generalized attack on RSA type cryptosystems, RSA: a number of formulas to improve the search for \(p+q\), A generalized attack on some variants of the RSA cryptosystem, On the security of RSA with primes sharing least-significant bits, The improved QV signature scheme based on conic curves over \(\mathbb Z_n\), A new construction of threshold cryptosystems based on RSA, Generalized cryptanalysis of small CRT-exponent RSA, Security pitfalls of an efficient threshold proxy signature scheme for mobile agents, A variant of Wiener's attack on RSA, Factorization using binary decision diagrams, Factoring RSA Moduli with Weak Prime Factors, Compositeness test with nodal curves, Constructing Permutation Rational Functions from Isogenies, Revisiting Wiener’s Attack – New Weak Keys in RSA, Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
