Abstract
An improved key expansion method is proposed to improve the security performance in AES key expansion. There is large difference of operation time between Mixcolumns and Inverse Mixcolumns, we propose the simplest form of MixColumn and InvMixColumn operation on finite field \(GF(2^{N})\) which consumes same computing resources in the process of encryption and decryption. In terms of the defection of RSA operation efficiency, traditional double prime number is replaced by four prime number, Chinese remainder theorem combined with Montgomery modular multiplication is also presented to optimize modular exponentiation. On this basis, we adopt message digest, digital signature, digital envelope and other technologies to build a mixed encryption system which encompasses convenient key management and high-efficiency encryption and decryption, combined with the advantages of AES and RSA. The experimental results show that optimized algorithm has high speed and feasibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wenling, W., Dengguo, F.: Research status of block cipher mode. Chin. J. Comput. 29, 22–25 (2006)
Qiuyu, Z., Pengfei, X., Yibo, H., Ruihong, D.: An efficient speech perceptual hashing authentication algorithm based on wavelet packet decomposition. J. Inf. Hiding Multimed. Sig. Process. 6, 311–322 (2015)
Guihua, C., Xuemei, Q., Yonglong, L.: Polynomial modulo operation in AES algorithm and its performance analysis. Comput. Technol. Dev. 20, 115–118 (2010)
Wiener, M.J.: Cryptoanalysis of short RSA secret exponents. IEEE Inf. Theory Soc. 36, 553–558 (1990)
Boneh, D., Durffe, G.: Cryptanalysis of RSA with private key d less than \(N^{0.292}\). IEEE Inf. Theory Soc. 46, 1339–1349 (2000)
Keying, H.: Research on Improved RSA Algorithm. University of Electronic Science and Technology, Chengdu (2010)
Yang, B.: Modern Cryptography. Tsinghua University Press, Beijing (2007)
Xiaofei, F., Huanying, H.: Security analysis of CRT - RSA algorithm. Microcomput. Inf. 25, 36–38 (2009)
An, W.: A Fast Implementation of RSA Public Key Cryptography. Shandong University, Jinan (2008)
Gongliang, C.: Information Security Mathematical Basis. Tsinghua University Press, Beijing (2011)
Stalling, W.: Cryprography and Network Security Principles and Practice. Publishing House of Eletronics Industry, Beijing (2011)
Couveigne, J.M., Ezome, T., Lercier, R.: A faster pseudo-primality test. Rendiconti del Circolo Matematico di Palermo 61, 261–278 (2012)
Acknowledgment
Project supported by the National Natural Science Foundation of China (Grant Nos. 61471158), and Project supported by the Modern sensor technology of Universities in Heilongjiang (Grant No. 2012TD007).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Liu, J., Fan, C., Tian, X., Ding, Q. (2018). Optimization of AES and RSA Algorithm and Its Mixed Encryption System. In: Pan, JS., Tsai, PW., Watada, J., Jain, L. (eds) Advances in Intelligent Information Hiding and Multimedia Signal Processing. IIH-MSP 2017. Smart Innovation, Systems and Technologies, vol 82. Springer, Cham. https://doi.org/10.1007/978-3-319-63859-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-63859-1_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63858-4
Online ISBN: 978-3-319-63859-1
eBook Packages: EngineeringEngineering (R0)