The κ-Fermat's Integer Factorization Algorithm
Published in The Journal of the Institute of Webcasting, Internet and Telecommunication • Jan 1, 2011
Authors:,
Myeong-Bok Choi
Sang-Un Lee
Abstract
It is very difficult problem to factorize composite number. Integer factorization algorithms, for the most part, find () that is congruence of squares ((mode )) with using factoring(factor base, B) and get the result, , with taking the greatest common divisor of Euclid based on the formula . The eff...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!