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

基于波粒二相机实现大数因子分解
引用本文:王婉莹,商斌,王川,龙桂鲁.基于波粒二相机实现大数因子分解[J].华中科技大学学报(自然科学版),2007,35(Z1).
作者姓名:王婉莹  商斌  王川  龙桂鲁
作者单位:1. 清华大学,物理系,北京,100084
2. 北京理工大学,计算机科学与技术系,北京,100081
3. 清华大学,原子分子纳米科学教育部重点实验室,北京,100084
摘    要:利用波粒二相机,根据原始的分解算法、量子Shor算法以及经典计算机中的费马算法和莱曼算法,提出了能够进行大数因子分解的几种算法.通过对原始分解算法的改进,使得用原始大数因子分解的问题由N次变为1次完成.通过对费马算法和莱曼算法改进,减少了大数质因子分解过程的计算复杂度.与量子计算机相比,波粒二相机使得在经典上需要指数步完成的算法,在多项式时间内就可以解决,减少了计算复杂度.

关 键 词:波粒二相机  质数分解  计算复杂度

Factorizing the large integers based on the duality computer
Wang Wanying,Shang Bin,Wang Chuan,Long Guilu.Factorizing the large integers based on the duality computer[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2007,35(Z1).
Authors:Wang Wanying  Shang Bin  Wang Chuan  Long Guilu
Abstract:Using the duality computer,based on a naive factorization method,the Shor algorithm in quantum computing,the Lehman method and the Fermat method in classical computing,we propose algorithms to factorize large integers.Through ameliorating the naive factorization method,it needs only one step to resolve the factorizing problem compared to N steps in the former.Through ameliorating the Lehman method and the Fermat method,we can reduce the computational complexity in the process of factorizing the large integers.Some exponential algorithms problems in quantum computers can be resolved in polynomial algorithms in the duality computer and the computational complexity can be decreased.
Keywords:duality computer  prime factorization  computational complexity
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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