Skip to content
Back
Journal article
Peer reviewed
A note on factoring α-LSBS moduli
Hung-Min Sun
,
Mu-En Wu
and
Cheng-Ta Yang
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E92-A(8), pp.2137-2138
08/2009
DOI:
https://doi.org/10.1587/transfun.E92.A.2137
Share
Export
Abstract
Related links
Metrics
Details
Abstract
Cryptography
Fermat's factorization algorithm
Integer factorization problem
Least-significant bit (LSB)
Most-significant bit (MSB)
RSA
In this letter the complexity of factoring an α-LSBS modulus is analyzed. This gives an improvement on the lower bound of the previous results. Copyright © 2009 The Institute of Electronics, Information and Communication Engineers.
Related links
Metrics
1
Record Views
Details
Title
A note on factoring α-LSBS moduli
Creators - without role
Hung-Min Sun - Department of Computer Science , National Tsing Hua University
Mu-En Wu - Institute of Information Science (IIS) in Academic Sinica
Cheng-Ta Yang - Department of Multimedia and Entertainment Science , Southern Taiwan University
Identifiers
9957773948706774
Academic Unit
Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language
English
Resource Type
Journal article
Publication Details
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E92-A(8), pp.2137-2138
Show the rest
Details