期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A holographic optical communication system based on RSA algorithm and quaternion function
1
作者 YANG Peng HAN Jianning 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2024年第3期338-343,共6页
A facile encryption way was successfully applied to the holographic optical encryption system with high speed,multidimensionality,and high capacity,which provided a better security solution for underwater communicatio... A facile encryption way was successfully applied to the holographic optical encryption system with high speed,multidimensionality,and high capacity,which provided a better security solution for underwater communication.The reconstructed optical security system for information transmission was based on wavelengthλand focal length f that were keys to encryption and decryption.To finish the secure data transmission(λ,f)between sender and receiver,an extended Rivest-Shamir-Adleman(ERSA)algorithm for the encryption was achieved based on three-dimension quaternion function.Therein,the Pollard’s rho method was used for the evaluation and comparison of RSA and ERSA algorithms.The results demonstrate that the message encrypted by the ERSA algorithm has better security than that by RSA algorithm in the face of unpredictability and complexity of information transmission on the unsecure acoustic channel. 展开更多
关键词 HOLOGRAPHY QUATERNION Fourier lens extended Rivest-shamir-Adleman(ERsA) pollard’s rho method
下载PDF
Improved Algorithm for Solving Discrete Logarithm Problem by Expanding Factor
2
作者 Bin Qi Jie Ma Kewei Lv 《China Communications》 SCIE CSCD 2020年第4期31-41,共11页
The discrete logarithm problem(DLP)is to find a solution n such that g^n=h in a finite cyclic group G=,where h∈G.The DLP is the security foundation of many cryptosystems,such as RSA.We propose a method to improve Pol... The discrete logarithm problem(DLP)is to find a solution n such that g^n=h in a finite cyclic group G=,where h∈G.The DLP is the security foundation of many cryptosystems,such as RSA.We propose a method to improve Pollard’s kangaroo algorithm,which is the classic algorithm for solving the DLP.In the proposed algorithm,the large integer multiplications are reduced by controlling whether to perform large integer multiplication.To control the process,the tools of expanding factor and jumping distance are introduced.The expanding factor is an indicator used to measure the probability of collision.Large integer multiplication is performed if the value of the expanding factor is greater than the given bound.The improved algorithm requires an average of(1.633+o(1))q(1/2)times of the large integer multiplications.In experiments,the average large integer multiplication times is approximately(1.5+o(1))q(1/2). 展开更多
关键词 discrete LOGARITHM ALGORITHM pollard’s KANGAROO ALGORITHM JUMPING DIsTANCE
下载PDF
关于区间上离散对数问题的改进算法 被引量:3
3
作者 王瑶 吕克伟 《密码学报》 CSCD 2015年第6期570-582,共13页
在群G上区间大小为N的离散对数问题为:给定g,h∈G以及大整数N,找到整数n(0≤n≤N),使得h=g^n,人们对于该问题的求解主要是对Pollard's kangaroos method的改进,尝试通过减少跳跃次数来优化算法,目前解决这一问题的最优低存储算法是V... 在群G上区间大小为N的离散对数问题为:给定g,h∈G以及大整数N,找到整数n(0≤n≤N),使得h=g^n,人们对于该问题的求解主要是对Pollard's kangaroos method的改进,尝试通过减少跳跃次数来优化算法,目前解决这一问题的最优低存储算法是Van Oorschot和Wiener版本的Pollard's kangaroos method,其平均情况下的时间代价是(2+0(1))√N次群运算.文中对解决这一问题的经典Pollard's kangaroos method进行改进得到新的求解算法.新算法是通过利用多次小整数乘法代替一次完整的大整数乘法来减少kangaroos每次跳跃的时间代价实现算法效率的提高.进一步,文中通过增加kangaroos的数量使得算法在跳跃次数和每次跳跃的时间代价两方面都得到改进,从而得到区间上离散对数问题的更有效的求解算法. 展开更多
关键词 离散对数(DLP) pollard’s KANGAROOs METHOD pollard’s RHO METHOD 区间 时间代价
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部