Access the full text.
Sign up today, get DeepDyve free for 14 days.
Alexander May (2004)
Secret Exponent Attacks on RSA-type Schemes with Moduli N= prq
W. Leveque (1977)
Fundamentals of number theory
May (2004)
Secret exponent attacks on RSA - type schemes with moduliN = prq Public Key Lecture Notes in Secret exponent attacks on RSA - type schemes with moduliN prqPublic Key CryptographyPKC Lecture Notes inCryptography PKC Comput Sci Comput Sci, 15
Takagi (1998)
Fast RSA - type cryptosystem modulopkq Advances in Lecture Notes in Fast RSA - type cryptosystem modulopkqAdvances in CryptologyCRYPTO Lecture Notes inCryptology CRYPTO Comput Sci Comput Sci, 25
R. Rivest, A. Shamir, L. Adleman (1978)
A method for obtaining digital signatures and public-key cryptosystemsCommun. ACM, 26
V. Shoup (2005)
A computational introduction to number theory and algebra
Pollard (1975)
A monte carlo method for factorization A monte carlo method for factorizationBITBIT, 19
S. Galbraith (2012)
Mathematics of Public Key Cryptography
C. Pomerance (1985)
The Quadratic Sieve Factoring Algorithm
J. Pollard (1975)
A monte carlo method for factorizationBIT Numerical Mathematics, 15
T. Okamoto, S. Uchiyama (1998)
A New Public-Key Cryptosystem as Secure as Factoring
Yao Lu, Rui Zhang, D. Lin (2013)
Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
Bach (1996)
Algorithmic Number Volume Efficient Algorithms MIT Press Algorithmic Number Volume Efficient AlgorithmsMIT PressCambridgeTheory Theory, 1
Lu (2013)
Factoring multi - power RSA modulusN prqwith partial known bits Information Security and Lecture Notes in Factoring multi - power RSA modulusN prqwith partial known bitsInformation Security and PrivacyACISP Lecture Notes inPrivacy ACISP Comput Sci Comput Sci, 14
Alexander May (2010)
Using LLL-Reduction for Solving RSA and Factorization Problems
Santanu Sarkar (2014)
Small secret exponent attack on RSA variant with modulus $$N=p^rq$$N=prqDesigns, Codes and Cryptography, 73
E. Bach, J. Shallit (1996)
Algorithmic number theory
Pomerance (1985)
The quadratic sieve factoring algorithm Advances in Lecture Notes in The quadratic sieve factoring algorithmAdvances in CryptologyEUROCRYPT Lecture Notes inCryptology EUROCRYPT Comput Sci Comput Sci, 20
A. Fujioka, T. Okamoto, S. Miyaguchi (1991)
ESIGN: An Efficient Digital Signature Implementation for Smard Cards
Pollard (1974)
Theorems on factorization and primality testing Theorems on factorization and primality testingMath CambridgeMath Proc Cambridge Soc Proc Philos Soc, 18
Itoh (2008)
Small secret key attack on a variant of RSA ( due to Takagi Topics in Cryptology Lecture Notes in Small secret key attack on a variant of RSA ( due to Takagi ) Topics in CryptologyCT - RSA Lecture Notes inComput Sci Comput Sci, 8
Fujioka (1991)
: An efficient digital signature implementation for smart cards Advances in Lecture Notes in An efficient digital signature implementation for smart cardsAdvances in CryptologyEUROCRYPT Lecture Notes inCryptology EUROCRYPT Comput Sci Comput Sci, 6
Okamoto (1998)
A new public - key cryptosystem as secure as factoring Advances in Lecture Notes in A new public - key cryptosystem as secure as factoringAdvances in CryptologyEUROCRYPT Lecture Notes inCryptology EUROCRYPT Comput Sci Comput Sci, 17
Steinfeld (2004)
On the security of RSA with primes sharing least - significant bits Algebra On the security of RSA with primes sharing least - significant bitsAppl Algebra EngrgAppl Comput Comput, 24
Kouichi Itoh, N. Kunihiro, K. Kurosawa (2008)
Small Secret Key Attack on a Variant of RSA (Due to Takagi)
Lenstra (1993)
The development of the number field sieve Lecture Notes in The development of the number field sieveLecture Notes inMath Math, 10
(2004)
Digital Object Identifier (DOI) 10.1007/s00200-004-0164-6 On the Security of RSA with Primes Sharing Least-Significant Bits ∗
B. Weger (2002)
Cryptanalysis of RSA with Small Prime DifferenceApplicable Algebra in Engineering, Communication and Computing, 13
D. Coppersmith (1997)
Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 10
A. Hung, C. Pomerance (1994)
The Development of the Number Field Sieve
Lenstra (1987)
Factoring integers with elliptic curves of Factoring integers with elliptic curvesAnn ofAnn Math Math, 11
Lehmer (1931)
On factoring large numbers On factoring large numbersBullBull Amer Math Soc Math Soc, 9
D. Boneh (2007)
Fast Variants of RSA
T. Takagi (1998)
Fast RSA-Type Cryptosystem Modulo pkq
Lim (2000)
A generalized takagi - cryptosystem with a modulus of the formprqs Progress in Lecture Notes in A generalized takagi - cryptosystem with a modulus of the formprqsProgress in CryptologyINDOCRYPT Lecture Notes inCryptology INDOCRYPT Comput Sci Comput Sci, 13
Boneh (1999)
prqfor larger Advances in Lecture Notes in prqfor largerAdvances in CryptologyCRYPTO Lecture Notes inCryptology CRYPTO Comput Sci Comput Sci, 2
Rivest (1978)
A method for obtaining digital signatures and public - key cryptosystems A method for obtaining digital signatures and public - key cryptosystemsCommun ACMCommun ACM, 21
D. Lehmer, R. Powers (1931)
On factoring large numbersBulletin of the American Mathematical Society, 37
H. Lenstra (1987)
Factoring integers with elliptic curvesAnnals of Mathematics, 126
J. Pollard (1974)
Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 76
D. Boneh, G. Durfee, Nick Howgrave-Graham (1999)
Factoring N = prq for Large r
Engrg (2002)
De Weger Cryptanalysis of RSA with small prime difference Algebra De WegerB Cryptanalysis of RSA with small prime differenceAppl Algebra EngrgAppl Comput Comput, 13
Seongan Lim, Seungjoo Kim, Ikkwon Yie, Hongsub Lee (2000)
A Generalized Takagi-Cryptosystem with a modulus of the form prqs
Boneh (2002)
Fast variants of RSA Fast variants of RSACryptoBytesCryptoBytes, 3
Abstract We study the factorization of a balanced multi-power RSA moduli N = p r q when the unknown primes p and q share t least or most significant bits. We show that if t ≥ 1/(1+ r )log p , then it is possible to compute the prime decomposition of N in polynomial time in log N . This result can be used to mount attacks against several cryptographic protocols that are based on the moduli N .
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.