共查询到19条相似文献,搜索用时 62 毫秒
1.
2.
本文对因子分解的椭圆曲线进行了分析,给出了算法各个步骤的具本实现技巧,用FORTRAN语言编制了程序,并给出了在微机上程序运行的情况。 相似文献
3.
分解大整数的一个新方法 总被引:1,自引:0,他引:1
In this paper, we prove the following result: Let a and bbe large integers, satisfying that (a, b)=1. If Diophantine equation ax+by=z has solutions: |X0|=O(log2ab) |y0|=O(log2ab) |Z0|=O(log2ab) then there is a polynomial-time algorithm that factors a large integern = ab , which runs in O(log2 6 n) time. Based on the proposed algorithm, we can factor easily n=1600000000000000229500000000000003170601. In fact, we have n=20000000000000002559 ×80000000000000001239, where 20000000000000002559 and 80000000000000001239 are all safe primes. Our result also shows that some safe primes are not safe. 相似文献
4.
5.
本文提出两种有效的RSA多签名方案,一种是Okamoto方案「6」的改进型,一种是Kiesler-Harn方案「3」的改进型。 相似文献
6.
7.
一种高效群签名方案的密码学分析 总被引:1,自引:0,他引:1
2005年,张键红等提出了一种基于RSA的高效群签名方案,签名与验证的计算量只需要9次模幂乘运算。该文提出了一种伪造攻击方案指出张等的方案是不安全的,任一群成员在撤消中心的帮助下可以不利用自己的秘密参数对任何消息生成有效的群签名。同时,指出了群成员的识别算法是错误的,身份追踪式是与具体签名无关的常量,即身份追踪算法无法追踪到真实的签名者。最后,指出了他们的方案具有关联性。 相似文献
8.
9.
10.
11.
基于因数分解和离散对数的数字签名协议 总被引:6,自引:0,他引:6
邵祖华 《信息安全与通信保密》1998,(4)
本文设计了两个数字签名协议,它们的安全性基于因数分解和离散对数的困难性,它们的性能类似于基本的ElGamal数字签名协议和Harn数字签名协议。本文还讨论了几种可能的攻击,证明了它们的安全性高于后两种数字签名协议。 相似文献
12.
13.
基于二进制冗余数的快速RSA算法的改进 总被引:2,自引:0,他引:2
陈运 《信息安全与通信保密》1997,(4)
介绍了BR,BRR和改进的BRR算法,提出了一种新的快速RSA算法,分析了新算法的速度。 相似文献
14.
对Montgomery算法进行了改进,提供了一种适合智能卡应用、以RISC微处理器形式实现的RSA密码协处理器。该器件的核心部分采用了两个32位乘法器的并行流水结构,其功能部件是并发操作的,指令执行亦采用了流水线的形式。在10MHz的时钟频率下,加密1024位明文平均仅需3ms,解密平均需177ms。 相似文献
15.
16.
Reza Fotohi Somayyeh Firoozi Bari Mehdi Yusefi 《International Journal of Communication Systems》2020,33(4)
Wireless sensor networks (WSNs) have been vastly employed in the collection and transmission of data via wireless networks. This type of network is nowadays used in many applications for surveillance activities in various environments due to its low cost and easy communications. In these networks, the sensors use a limited power source which after its depletion, since it is non‐renewable, network lifetime ends. Due to the weaknesses in sensor nodes, they are vulnerable to many threats. One notable attack threating WSN is Denial of Sleep (DoS). DoS attacks denotes the loss of energy in these sensors by keeping the nodes from going into sleep and energy‐saving mode. In this paper, the Abnormal Sensor Detection Accuracy (ASDA‐RSA) method is utilized to counteract DoS attacks to reducing the amount of energy consumed. The ASDA‐RSA schema in this paper consists of two phases to enhancement security in the WSNs. In the first phase, a clustering approach based on energy and distance is used to select the proper cluster head and in the second phase, the RSA cryptography algorithm and interlock protocol are used here along with an authentication method, to prevent DoS attacks. Moreover, ASDA‐RSA method is evaluated here via extensive simulations carried out in NS‐2. The simulation results indicate that the WSN network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), network lifetime, detection ratio, and average residual energy. 相似文献
17.
18.
19.
An efficient mixed mode and paired cipher text cryptographic algorithm for effective key distribution 下载免费PDF全文
Widely used asymmetric key or public key systems such as RSA, Rabin system, ElGamal system, and elliptical curve system are based on a single hard mathematical problem such as factoring or discrete logarithm. Even if these algorithms are very secure now, in the future, the situation may change and someone can solve the single hard problem easily. In this work, a new mixed mode cryptographic algorithm based on RSA is designed, which incorporates three hard mathematical problems (hidden root problem, discrete logarithms, and factoring) to make the algorithm too secure and uses the properties of both symmetric and asymmetric key algorithms. The decryption of the cipher text by the cryptanalysts is very difficult without the knowledge of secret keys, because he or she needs to solve three hard mathematical problems, which is in fact impractical. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献