IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
A Note on Factoring α-LSBS Moduli
Hung-Min SUN, Mu-En WU, Cheng-Ta YANG
Author information
Keywords: Fermat's factorization algorithm, cryptography, RSA, integer factorization problem, most-significant bit (MSB), least-significant bit (LSB)
JOURNAL RESTRICTED ACCESS

2009 Volume E92.A Issue 8 Pages 2137-2138

Details
Download PDF (62K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

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

Content from these authors
© 2009 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Announcements from publisher
Share this page
feedback
 Top