首页 | 本学科首页   官方微博 | 高级检索  
     


Square form factorization
Authors:Jason E. Gower   Samuel S. Wagstaff Jr..
Affiliation:Institute for Mathematics and its Applications, University of Minnesota, 424 Lind Hall, 207 Church St. S.E., Minneapolis, Minnesota 55455-0436 ; Center for Education and Research in Information Assurance and Security, and Department of Computer Science, Purdue University, West Lafayette, Indiana 47907
Abstract:We present a detailed analysis of SQUFOF, Daniel Shanks' Square Form Factorization algorithm. We give the average time and space requirements for SQUFOF. We analyze the effect of multipliers, either used for a single factorization or when racing the algorithm in parallel.

Keywords:Integer factorization   binary quadratic form
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号