A Big Data Security Scheme Based on High-Performance Cryptography Implementation

被引：0
|
作者：
Yang G. [1 ]
Ding H. [2 ]
Zou J. [3 ]
Jiang H. [4 ]
Chen Y. [5 ]
机构：
[1] School of Computer Science and Technology, Shandong University, Jinan
[2] College of Mathematics, Shandong University, Jinan
[3] State Grid Economic and Technological Research Institute Co., Ltd, Beijing
[4] School of Software, Shandong University, Jinan
[5] Beijing Sansec Technology Development Co., Ltd, Beijing
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2019年 / 56卷 / 10期
基金：
中国国家自然科学基金;
关键词：
Big data; High-speed implementation of cryptographic algorithm; Modular exponentiation; SM2; SM4-XTS;
D O I：
10.7544/issn1000-1239.2019.20190390
中图分类号：
学科分类号：
摘要：
At present, the trend of information technology development is the artificial intelligence technology based on big data computing. Although it has made enormous contribution in the economic development, big data processing technology which includes cloud computing, fog computing, edge computing and other computing modes also brings a great risk of data security. Cryptographic technology is the kernel of the big data security. Confidentiality, authentication and privacy protection of big data need to solve the following three security problems: firstly, high-speed encryption and decryption of massive data; secondly, the authentication problem of high concurrency and large scale user; thirdly, privacy protection in data mining. The solution of these problems requires the fast implementation of the underlying cryptographic algorithm. Aiming at the logic architecture of big data security application, this paper gives a fast calculation algorithm for the cryptographic standard algorithm SM4-XTS, SM2 and modular exponentiation of large integers. It is verified on the KC705 development board based on Xilinx company, the results of experiment show that our work has certain advancement: 1) The implementation of SM4-XTS fills the blank of this direction in China. 2) SM2 signature has high performance, leading domestic similar products. 3) Modular exponentiation is applied to the productization of homomorphism cryptography, and its performance is ahead of other similar products. © 2019, Science Press. All right reserved.
引用
收藏
页码：2207 / 2215
页数：8
相关论文
共 19 条
  • [1] Feng D., Zhang M., Zhang Y., Et al., Study on cloud computing security, Journal of Software, 22, 1, pp. 71-83, (2011)
  • [2] Elbirt J., Chetwynd B., Paar C., Et al., An FPGA implementation and performance evaluation of the AES block cipher candidate algorithm finalist, Proc of the 3rd AES Conf (AES3), pp. 192-201, (2000)
  • [3] P1619-2007 the XTS-AES Tweakable Block Cipher, (2008)
  • [4] Ansari B., Hasan M., High performance architecture of elliptic curve scalar multiplication, CACR-2006-01, (2006)
  • [5] Damgard I., Jurik M., A generalisation, a simplication and some applications of Paillier's probabilistic public-key system, Lecture Notes in Computer Science, 7, 45, pp. 119-136, (2001)
  • [6] Bao K., Song Y., Optimizing and realization of the finite field inversion algorithm based on FPGA, Computer Engineering, 32, 23, pp. 156-159, (2006)
  • [7] Paillier P., Public-key cryptosystems based on composite degree residuosity classes, LNCS 1592: Proc of Eurocrypt'99, pp. 223-238, (1999)
  • [8] Choi S., Won D., Improvement of probabilistic public key cryptosystems using discrete logarithm, Proc of Int Conf on Information Security and Cryptology, pp. 72-80, (2001)
  • [9] Gueron S., Efficient software implementations of modular exponentiation, Journal of Cryptographic Engineering, 9, 2, pp. 31-43, (2012)
  • [10] Kazuhiko M., Improved security analysis of XEX and LRW modes, LNCS 4356: Proc of SAC 2006, pp. 96-113, (2007)
12