The Community for Technology Leaders
Multimedia and Ubiquitous Engineering, International Conference on (2007)
Seoul, Korea
Apr. 26, 2007 to Apr. 28, 2007
ISBN: 0-7695-2777-9
pp: 729-732
Qingfeng Huang , HuaZhong University of Science and Technology, Wuhan, China
Zhitang Li , HuaZhong University of Science and Technology, Wuhan, China
Yejing Zhang , HuaZhong University of Science and Technology, Wuhan, China
Chuiwei Lu , HuaZhong University of Science and Technology, Wuhan, China
ABSTRACT
This paper addresses the problem-how to factor big simple blur integers quickly.We definite simple blur integer at first,and then give some theorems about it.Based on these theorems and the primitive nonsieving quadratic sieve(PNQS), we proposed a modified non-sieving quadratic sieve(MNQS) .In MNQS,we not only reduce the times of squares and modulo n,but also imply another important conclusion,that is,we don?t need to choose a factor base and find the greatest common divisor of two integers as we do in PNQS.We argue that each algorithm has its virtue when factoring some special form of n.We find that when factoring n whose two factors?s difference is little, MNQS is fast than elliptic curve algorithm.we vertify our conclusion by some examples.
INDEX TERMS
null
CITATION

Z. Li, Y. Zhang, C. Lu and Q. Huang, "A Modified Non-Sieving Quadratic Sieve For Factoring Simple Blur Integers," 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07)(MUE), Seoul, 2007, pp. 729-732.
doi:10.1109/MUE.2007.28
99 ms
(Ver 3.3 (11022016))