A Note on Factoring α-LSBS Moduli

Hung-Min SUN  Mu-En WU  Cheng-Ta YANG  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E92-A   No.8   pp.2137-2138
Publication Date: 2009/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E92.A.2137
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Cryptography and Information Security
Keyword: 
Fermat's factorization algorithm,  cryptography,  RSA,  integer factorization problem,  most-significant bit (MSB),  least-significant bit (LSB),  

Full Text: PDF(61.4KB)
>>Buy this Article


Summary: 
In this letter the complexity of factoring an α-LSBS modulus is analyzed. This gives an improvement on the lower bound of the previous results.