Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Factoring multi-power RSA moduli with primes sharing least or most significant bits

Factoring multi-power RSA moduli with primes sharing least or most significant bits 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 . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Factoring multi-power RSA moduli with primes sharing least or most significant bits

Akchiche, Omar; Khadir, Omar
Groups Complexity Cryptology , Volume 8 (1) – May 1, 2016
Download PDF
8 pages

Loading next page...
 
/lp/de-gruyter/factoring-multi-power-rsa-moduli-with-primes-sharing-least-or-most-gl63qif8sv
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2016-0002
Publisher site
See Article on Publisher Site

Abstract

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 .

Journal

Groups Complexity Cryptology – de Gruyter

Published: May 1, 2016

References

  • Factoring integers with elliptic curves of Factoring integers with elliptic curvesAnn of
    Lenstra
  • A monte carlo method for factorization A monte carlo method for factorizationBIT
    Pollard
  • 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 in
    May
  • On factoring large numbers On factoring large numbersBull
    Lehmer
  • Algorithmic Number Volume Efficient Algorithms MIT Press Algorithmic Number Volume Efficient AlgorithmsMIT PressCambridge
    Bach
  • 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 in
    Lu
  • Theorems on factorization and primality testing Theorems on factorization and primality testingMath Cambridge
    Pollard
  • 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 in
    Itoh
  • The quadratic sieve factoring algorithm Advances in Lecture Notes in The quadratic sieve factoring algorithmAdvances in CryptologyEUROCRYPT Lecture Notes in
    Pomerance
  • Fast variants of RSA Fast variants of RSACryptoBytes
    Boneh
  • Fast RSA - type cryptosystem modulopkq Advances in Lecture Notes in Fast RSA - type cryptosystem modulopkqAdvances in CryptologyCRYPTO Lecture Notes in
    Takagi
  • De Weger Cryptanalysis of RSA with small prime difference Algebra De WegerB Cryptanalysis of RSA with small prime differenceAppl Algebra Engrg
    Engrg
  • : 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 in
    Fujioka
  • prqfor larger Advances in Lecture Notes in prqfor largerAdvances in CryptologyCRYPTO Lecture Notes in
    Boneh
  • The development of the number field sieve Lecture Notes in The development of the number field sieveLecture Notes in
    Lenstra
  • 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 in
    Okamoto
  • A method for obtaining digital signatures and public - key cryptosystems A method for obtaining digital signatures and public - key cryptosystemsCommun ACM
    Rivest
  • 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 in
    Lim
  • On the security of RSA with primes sharing least - significant bits Algebra On the security of RSA with primes sharing least - significant bitsAppl Algebra Engrg
    Steinfeld