期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
傅里叶变换对称性在整数因式分解中求阶的应用
1
作者 张小梅 柴群 吴福生 《凯里学院学报》 2019年第3期21-24,共4页
大整数因式分解,一直以来都是公钥密码分析的一个研究热点问题之一.对大整数因式分解问题可以归约到基于傅里叶变换求阶问题.经典计算机上求解大整数的因子都是一个NP难题.直到shor算法的出现,大整数分解的难解问题理论上可以在PPT(prob... 大整数因式分解,一直以来都是公钥密码分析的一个研究热点问题之一.对大整数因式分解问题可以归约到基于傅里叶变换求阶问题.经典计算机上求解大整数的因子都是一个NP难题.直到shor算法的出现,大整数分解的难解问题理论上可以在PPT(probabilistic polynomial time,中文称之为概率多项式时间,是密码协议的一种概率算法,类似于掷硬币)内求解,这种理论上的求解主要是在量子计算机上执行量子傅里叶变换,以求解交换子群的阶为目的.本文把傅里变换的对称性,应用于量子算法大整数因式分解求阶之中,使得其时间与存储空间减半. 展开更多
关键词 傅里叶变换 量子计算机 量子计算 整数因式分解
在线阅读 下载PDF
A NEW PUBLIC-KEY ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE 被引量:2
2
作者 Jiang Zhengtao Hao Yanhua Wang Yumin 《Journal of Electronics(China)》 2005年第5期490-497,共8页
Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is ... Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed. 展开更多
关键词 Probabilistic public-key encryption scheme LUCas sequence(LUC) Discrete logarithm Integer factorization
在线阅读 下载PDF
Introducing Quaternions to Integer Factorisation
3
作者 HuiKang Tong 《Journal of Physical Science and Application》 2015年第2期101-107,共7页
The key purpose of this paper is to open up the concepts of the sum of four squares and the algebra of quaternions into the attempts of factoring semiprimes, the product of two prime numbers. However, the application ... The key purpose of this paper is to open up the concepts of the sum of four squares and the algebra of quaternions into the attempts of factoring semiprimes, the product of two prime numbers. However, the application of these concepts here has been clumsy, and would be better explored by those with a more rigorous mathematical background. There may be real immediate implications on some RSA numbers that are slightly larger than a perfect square. 展开更多
关键词 Integer factorisation RSA quatemions sum of four squares euler factorisation method.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部