共查询到20条相似文献,搜索用时 201 毫秒
1.
2.
提出一种GF(p)上椭圆曲线密码系统的并行基点选取算法,该算法由并行随机点产生算法和并行基点判断算法两个子算法组成,给出了算法性能的理论分析和实验结果.结果表明:各并行处理器单元具有较好的负载均衡特性;当执行并行基点判断算法,其标量乘的点加计算时间是点倍数计算时间的三倍时,算法的并行效率可达90%.因此该算法可用于椭圆曲线密码(Elliptic Curve Cryptography,ECC)中基点的快速选取,从而提高ECC的加/解密速度. 相似文献
3.
4.
5.
对简化轮数的SNAKE(2)算法的中间相遇攻击 总被引:1,自引:0,他引:1
SNAKE算法是由Lee等学者在JW-ISC1997上提出的一个Feistel型分组密码,有SNAKE(1)和SNAKE(2)两个版本。本文评估了简化轮数的SNAKE(2)算法对中间相遇攻击的抵抗能力,用存储复杂度换取时间复杂度,对7/8/9轮64比特分组的SNAKE(2)算法实施了攻击。攻击结果表明,9轮的SNAKE(2)算法对中间相遇攻击是不抵抗的,攻击的数据复杂度和时间复杂度分别为211.2和222,预计算复杂度为232,是现实攻击。 相似文献
6.
针对一种基于特征GF(2m)域的椭圆曲线密码(ECC)VLSI实现进行定时攻击分析,结果表明采用DA(Double Add)算法的ECC实现,可能泄漏密钥的汉明重量和其他电路秘密信息.在此基础上,利用统计分析提出一种引入随机延时来掩蔽时间特征的防护方法.攻击试验结果表明,该方法能够以4个有限域模乘运算模块的代价有效地增强ECC实现的抗定时攻击性. 相似文献
7.
8.
9.
MIBS算法于2009年在CANS会议上提出,是一个32轮Feistel结构、64比特分组长度以及包含64比特、80比特两种主密钥长度的轻量级分组密码.针对该算法密钥编排中第1轮到第11轮子密钥之间存在部分重复和等价关系,本文首次完成了MIBS-64的11轮三子集中间相遇攻击,数据复杂度为247,存储复杂度为24764-bit,时间复杂度为262.25次11轮加密.与目前已有的对MIBS-64算法的中间相遇攻击相比,将攻击轮数由10轮扩展至11轮,刷新了该算法在中间相遇攻击下的安全性评估结果. 相似文献
10.
在分析分组密码算法的安全性时,利用密钥关系来降低时间、存储和数据复杂度是一个常用的手段.在4轮mCrypton-96性质的基础上,利用密钥生成算法的弱点和S盒的性质,降低了攻击过程中需要猜测的密钥比特数,提出了对8轮mCrypton-96算法的中间相遇攻击,攻击的时间复杂度约为2\\+{93.5}次8轮mCrypton-96加密运算,存储复杂度为2\\+{47}B,数据复杂度为2\\+{57}个选择明文. 相似文献
11.
并行PoHard rho算法是目前攻击椭圆曲线密码体制(Elliptic Curve Cryptosystem,简称ECC)的最好算法,国内外的研究十分活跃。本文首先介绍了攻击F2^m上ECC的并行Pouard rho算法及我们的实现流程,然后给出了核心基本运算(包括求逆、一般乘挚、平方、求模等)的优化算法。实验数据表明,根据本文优化算法编制的MPI并行程序在多机上加速比良好,运算速度优于互族网上公开的程序。 相似文献
12.
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both single‐instruction multiple‐data (SIMD) instructions and thread‐level parallelism. In this paper, we propose a new high‐performance sorting algorithm, called aligned‐access sort (AA‐sort), that exploits both the SIMD instructions and thread‐level parallelism available on today's multicore processors. Our algorithm consists of two phases, an in‐core sorting phase and an out‐of‐core merging phase. The in‐core sorting phase uses our new sorting algorithm that extends combsort to exploit SIMD instructions. The out‐of‐core algorithm is based on mergesort with our novel vectorized merging algorithm. Both phases can take advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions in both phases. We implemented and evaluated the AA‐sort on PowerPC 970MP and Cell Broadband Engine platforms. In summary, a sequential version of the AA‐sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and bitonic mergesort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 million random 32‐bit integers. Also, a parallel version of AA‐sort demonstrated better scalability with increasing numbers of cores than a parallel version of bitonic mergesort on both platforms. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
13.
Sorted lists of integers are commonly used in inverted indexes and database systems. They are often compressed in memory. We can use the single‐instruction, multiple data (SIMD) instructions available in common processors to boost the speed of integer compression schemes. Our S4‐BP128‐D4 scheme uses as little as 0.7 CPU cycles per decoded 32‐bit integer while still providing state‐of‐the‐art compression. However, if the subsequent processing of the integers is slow, the effort spent on optimizing decompression speed can be wasted. To show that it does not have to be so, we (1) vectorize and optimize the intersection of posting lists; (2) introduce the SIMD GALLOPING algorithm. We exploit the fact that one SIMD instruction can compare four pairs of 32‐bit integers at once. We experiment with two Text REtrieval Conference (TREC) text collections, GOV2 and ClueWeb09 (category B), using logs from the TREC million‐query track. We show that using only the SIMD instructions ubiquitous in all modern CPUs, our techniques for conjunctive queries can double the speed of a state‐of‐the‐art approach. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
14.
基于ECC的移动通信认证和密钥协商协议 总被引:4,自引:0,他引:4
提出一个基于椭圆曲线密码体制(ECC)的快速认证和密钥协商协议,用于移动通信中任意移动用户之间或者移动用户和网络之间进行安全会话的认证和密钥协商。协议把ECC引入Diffie—Hellman密钥交换过程,并在此过程中添加证书认证方案来完成相互认证和密钥协商。采用ECC使该协议在更小密钥量下提供了更大的安全性,所需带宽明显减少,而且还大大降低了用户端的计算负担和存储要求。 相似文献
15.
针对目前RSA (Rivest-Shamir-Adleman)同态加密方法计算效率低、公钥尺寸大、计算复杂度高的缺点,结合ECC (elliptic curve cryptography)与同态加密方法,提出一种改进的同态加密算法。在椭圆曲线加密算法的基础上,使用不同的私钥生成公钥并构造乘法同态加密方法,通过公钥对嵌入椭圆曲线中的点集加密并上传密文到云端。理论分析与实验结果表明,相对于目前的同态加密方法,改进后的加密算法在保证安全性的同时,解决了公钥尺寸大和计算复杂度高的问题,可直接对云中密文操作无需解密成明文。 相似文献
16.
基于椭圆曲线加密算法技术优势的探讨 总被引:7,自引:0,他引:7
ECC is a safer and more practical public key system than the other cryptography algorithm since public key cryptogram debited. Advantages of ECC on technology are exploited in this paper, which ensures itself a popular cryptography algorithm for public key system. 相似文献
17.
VLIW DSP通过软件流水获得时间并行性,通过指令分簇获得空间并行性.指令的分簇本质上是资源分配问题.传统的指令分簇假设一条指令分到某一簇执行,而某些体系结构提供SIMD指令,传统的分簇算法对这类体系结构并不完全适用.提出的基于评估模型的分簇算法能对SIMD指令和普通指令进行合理的分簇.分簇之后,通过调度簇间传输指令,合成适当的簇间双字传输指令.由于SIMD和簇间双字传输的引入,以及较好的分簇决策,程序整体的调度延迟变短.对许多数字信号处理程序相对于没分簇的情况下的性能有2~3倍的性能提升,相对寄存器压力分簇算法有约7~10%性能的提升. 相似文献
18.
有限差分算法是一种基于偏微分方程的数值离散方法,被广泛应用于弹性波传播问题的数值模拟中。该算法访存跨度大、计算密度高、CPU利用率低,这在实际应用中成为了性能瓶颈。针对上述问题,在详析3D有限差分算法(3DFD)的基础上,基于Intel MIC架构,采用三步递进法对其进行优化:首先,通过分支消除、循环展开、不变量外提等基本优化法削减计算强度并为向量化扫除障碍;然后,通过分析数据依赖及循环分块,使用向量指令集改写核心算法等并行优化法,充分利用MIC协处理器多线程、长向量的机制;最后,在异构众核平台(CPU+MIC:Many Integra-ted Cores)下通过数据传输最小化、负载均衡等异构协同优化法实现CPU和MIC的并行计算。实验验证,与原有算法相比,优化后的算法在异构平台上获得了50~120倍的加速。 相似文献
19.
An improved protocol with a key agreement authentication using parallel Pollard rho algorithm for electronic payment system is proposed in this paper. The protocol employs a two step of key agreement and authentication with parallel Pollard rho and encryption of transaction information using Elliptic Curve Digital Signature Algorithm (ECDSA). Pollard rho was used in parallel as a key calculator that measures attack on discrete logarithm problem (DLP) of three main e-payment parties, namely customer, merchant and bank. Customers card information was used to infer the discrete logarithm problem which in turn was reused by the merchant and bank. The ECDSA was applied to encrypt information, resulting in a combination of the summation of participatory key, l. The length l serves as a diversion against intruders’ attempt to guess the DLP. The result shows that the protocol ensured higher security within a shorter period of time in comparison with others in the literature. 相似文献