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

Groups Complexity Cryptology , Volume 8 (1) – May 1, 2016

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 Cryptologyde Gruyter

Published: May 1, 2016

References