首页> 外文OA文献 >Study of high-speed realization technics for elements of symmetric encryption algorithms during calculations on graphics processor
【2h】

Study of high-speed realization technics for elements of symmetric encryption algorithms during calculations on graphics processor

机译:图形处理器计算期间对称加密算法元素高速实现技术研究

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Subject of Research. The paper deals with the research of transformations used in up-to-date symmetric algorithms aimed at definition of the most high-speed ways of their realization on the graphics processor with the use of CUDA and OpenCL technologies. Method. To achieve this goal, we considered LSX and ARX structures of block algorithms on the example of the following ciphers: AES, «Kuznyechik», LEA, Rectangle, Simon and Speck. The main types of transformations were detected, which include: multiplication in Galois fields, the use of lookup tables, bitwise operations, long number addition and data exchange with the global memory as an integral part of the calculations on graphics devices. The variants of the implementation of these calculations were considered and synthetic tests were carried out to determine their execution time. Main Results. The best ways for implementation of these transformations were determined. When performing multiplication in Galois fields, if one of the multipliers is constant, the best time was shown by the method using the pre-calculation table. It was also found that the most effective in terms of speed is the storage of replacement tables in shared memory and the implementation of bitwise operations with the division of input data into 8-bit elements, as in the case of long numbers addition. The result approbation was carried out by CLEFIA algorithm realization.The encryption time of 1 GB of data was 1542 mc. This result is 16 times less than the encryption time on the general-purpose processor. The application of realization variants for studied transformations that show the worst time results during synthetic tests on graphics processors gives fourfold speed increase compared with the central processor. Practical Relevance. The study results are applicable for the speedy and efficient use of graphics processors in the implementation of existing encryption algorithms. The results can become the basis for the development of new encryption algorithms with the use of graphics processors.
机译:研究主题。本文涉及对对称算法中使用的转换的研究,该算法旨在定义在图形处理器上使用CUDA和OpenCL技术定义了图形处理器的最高速度。方法。为了实现这一目标,我们考虑了在以下CIPHers的示例中考虑了LSX和ARX结构:AES,«Kuznyechik»,Lea,矩形,西蒙和斑点。检测到主要类型的转换类型,其中包括:在Galois字段中乘法,使用查找表,按位操作,长号添加和数据交换,作为Global Memory作为图形设备上计算的组成部分。考虑了这些计算的实施的变体,并进行了合成测试以确定其执行时间。主要结果。确定了实现这些变换的最佳方法。在进行Galois字段中执行乘法时,如果其中一个乘法器是恒定的,则使用预计算表的方法显示了最佳时间。还发现,在速度方面最有效的是在共享存储器中存储替换表,并使用输入数据的划分为8位元素的按位操作的实现,如在长号添加的情况下。结果认证是由Clefia算法实现进行的.1 GB数据的加密时间为1542 MC。此结果比通用处理器上的加密时间小16倍。用于研究变形的实现变体,显示了在图形处理器上的合成测试期间显示最糟糕的时间结果,使四倍速度增加与中央处理器相比。实际相关性。该研究结果适用于在实现现有加密算法的实施中的快速和有效地利用图形处理器。结果可以成为利用图形处理器开发新加密算法的基础。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号