algorithms for integer factorization based on counting solutions of various modular equations整数分解算法基于各种模块化方程的计算解决方案.pdfVIP

  • 4
  • 0
  • 约5.12万字
  • 约 8页
  • 2017-08-27 发布于上海
  • 举报

algorithms for integer factorization based on counting solutions of various modular equations整数分解算法基于各种模块化方程的计算解决方案.pdf

algorithms for integer factorization based on counting solutions of various modular equations整数分解算法基于各种模块化方程的计算解决方案

Int. J. Communications, Network and System Sciences, 2011, 4, 675-682 doi:10.4236/ijcns.2011.411083 Published Online November 2011 (http://www.SciRP.org/journal/ijcns) Algorithms for Integer Factorization Based on Counting Solutions of Various Modular Equations Boris S. Verkhovsky Computer Science Department, New Jersey Institute of Technology, Newark, USA E-mail : verb73@ Received September 20, 2011; revised Octob

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档