Abstract
Since traditional cryptosystems have been vigorously challenged in recent years by quantum computing, using multivariate systems to design cryptosystems becomes a possible choice among those post-quantum candidates. However, compared with traditional cryptosystems (RSA, ECC, etc.), multivariate systems might not be cost-friendly for practical applications. In recent years, GPU is widely used in machine learning with respect to its massive parallel computing power. To the best of our knowledge, all the published GPU acceleration schemes for multivariate systems are based on quadratic multivariate systems, and they might not be applicable for high-order multivariate cryptography systems. In this paper, we propose a generic GPU acceleration framework for multivariate systems with various orders. The experiment results show that our optimization method can effectively improve the performance of multivariate cryptosystems on GPUs.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ahmadzadeh A, Hajihassani O, Gorgin S (2018) A high-performance and energy-efficient exhaustive key search approach via GPU on des-like cryptosystems. J Supercomput 74(1):160–182. https://doi.org/10.1007/s11227-017-2120-9
Ahmed E, Chatzimisios P, Gupta BB, Jararweh Y, Song H (2018) Recent advances in fog and mobile edge computing. Trans Emerg Telecommun Technol. https://doi.org/10.1002/ett.3307
Berbain C, Billet O, Gilbert H (2006) Efficient implementations of multivariate quadratic systems. In: Biham E, Youssef AM (eds) Selected areas in cryptography, 13th international workshop, SAC 2006, Montreal, Canada, August 17–18, 2006 Revised selected papers, Lecture notes in computer science, vol 4356, pp 174–187. Springer, New York. https://doi.org/10.1007/978-3-540-74462-7_13
Chandramouli R, Iorga M, Chokhani S (2014) Cryptographic key management issues and challenges in cloud services. In: Secure cloud computing. Springer, New York, pp 1–30
Chen M, Chen T, Cheng C, Hsiao C, Yang RNB (2010) What price a provably secure stream cipher? Invited talk. 17th International Workshop, FSE 2010, Seoul, Korea, February 7-10. Available at https://www.iacr.org/workshops/fse2010/content/slide/What%20price%20a%20provably%20secure%20stream%20cipher%20by%20Chen.pdf
Chen L, Jordan S, Liu YK, Moody D, Peralta R, Perlner R, Smith-Tone D (2016) Report on post-quantum cryptography. US Department of Commerce, National Institute of Standards and Technology
Criado JMG, Vega-Rodríguez MA (2017) Hardware coprocessors for high-performance symmetric cryptography. J Supercomput 73(6):2456–2482. https://doi.org/10.1007/s11227-016-1929-y
Din S, Paul A, Ahmad A, Gupta BB, Rho S (2018) Service orchestration of optimizing continuous features in industrial surveillance using big data based fog-enabled internet of things. IEEE Access 6:21582–21591. https://doi.org/10.1109/ACCESS.2018.2800758
Ding J, Gower JE, Schmidt D (2006) Multivariate public key cryptosystems, advances in information security, vol 25. Springer, New York. https://doi.org/10.1007/978-0-387-36946-4
Fell H, Diffie W (1985) Analysis of a public key approach based on polynomial substitution. In: Conference on the theory and application of cryptographic techniques. Springer, New York, pp 340–349
Gao C, Cheng Q, Li X, XiaYa S (2018) Cloud-assisted privacy-preserving profile-matching scheme under multiple keys in mobile social network. Clust Comput. https://doi.org/10.1007/s10586-017-1649-y
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York
Gupta S, Gupta BB (2017) Smart XSS attack surveillance system for OSN in virtualized intelligence network of nodes of fog computing. Int J Web Serv Res 14(4):1–32. https://doi.org/10.4018/IJWSR.2017100101
Guyeux C, Couturier R, Héam P, Bahi JM (2015) Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU. J Supercomput 71(10):3877–3903. https://doi.org/10.1007/s11227-015-1479-8
Huber K (1990) Some comments on Zech’s logarithms. IEEE Trans Inf Theory 36(4):946–950. https://doi.org/10.1109/18.53764
Hussein NH, Khalid A, Khanfar K (2016) A survey of cryptography cloud storage techniques. Int J Comput Sci Mobile Comput 5(2):186–191
Jaber AN, Zolkipli MFB (2013) Use of cryptography in cloud computing. In: 2013 IEEE international conference on control system, computing and engineering, ICCSCE 2013, Penang, Malaysia, November 29–December 1, 2013. IEEE, pp 179–184. https://doi.org/10.1109/ICCSCE.2013.6719955
Jean J (2016) TikZ for cryptographers. https://www.iacr.org/authors/tikz/
Li J, Zhang Y, Chen X, Xiang Y (2018) Secure attribute-based data sharing for resource-limited users in cloud computing. Comput Secur 72:1–12. https://doi.org/10.1016/j.cose.2017.08.007
Li Y, Wang G, Nie L, Wang Q, Tan W (2018) Distance metric optimization driven convolutional neural network for age invariant face recognition. Pattern Recogn 75:51–62. https://doi.org/10.1016/j.patcog.2017.10.015
Li Z, Dong X, Wang X (2017) Quantum cryptanalysis on some generalized feistel schemes. Cryptology ePrint Archive, Report 2017/1249. https://eprint.iacr.org/2017/1249
Li W, Liao G, Wen Y, Gong Z (2017) Spongemph: a new multivariate polynomial hash function based on the sponge construction. In: Second IEEE international conference on data science in cyberspace, DSC 2017, Shenzhen, China, June 26–29, 2017. IEEE Computer Society, pp 516–520. https://doi.org/10.1109/DSC.2017.105
Liu Q, Guo Y, Wu J, Wang G (2017) Effective query grouping strategy in clouds. J Comput Sci Technol 32(6):1231–1249. https://doi.org/10.1007/s11390-017-1797-9
Ma X, Li J, Zhang F (2013) Outsourcing computation of modular exponentiations in cloud computing. Clust Comput 16(4):787–796. https://doi.org/10.1007/s10586-013-0252-0
Manasrah AM, Aldomi A, Gupta BB (2017) An optimized service broker routing policy based on differential evolution algorithm in fog/cloud environment. Clust Comput. https://doi.org/10.1007/s10586-017-1559-z
Matsumoto T, Imai H (1988) Public quadratic polynominal-tuples for efficient signature-verification and message-encryption. Eurocrypt 88:419–453
Shalf JM, Leland R (2015) Computing beyond moore’s law. IEEE Comput 48(12):14–23. https://doi.org/10.1109/MC.2015.374
Shen J, Gui Z, Ji S, Shen J, Tan H, Tang Y (2018) Cloud-aided lightweight certificateless authentication protocol with anonymity for wireless body area networks. J Netw Comput Appl. https://doi.org/10.1016/j.jnca.2018.01.003
Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5):1484–1509. https://doi.org/10.1137/S0097539795293172
Tanaka S, Nishide T, Sakurai K (2013) Efficient implementation for QUAD stream cipher with gpus. Comput Sci Inf Syst 10(2):897–911. https://doi.org/10.2298/CSIS121102040T
Tanaka S, Yasuda T, Sakurai K (2014) Fast evaluation of multivariate quadratic polynomials over gf(\(2^{32}\)) using grahpics processing units. J Internet Serv Inf Secur 4(3):1–20
Tanaka S, Nishide T, Sakurai K (2012) Efficient implementation of evaluating multivariate quadratic system with gpus. In: You I, Barolli L, Gentile A, Jeong HJ, Ogiela MR, Xhafa F (eds) Sixth international conference on innovative mobile and internet services in ubiquitous computing, IMIS 2012, Palermo, Italy, July 4–6, 2012. IEEE Computer Society, pp 660–664. https://doi.org/10.1109/IMIS.2012.139
Tanaka S, Yasuda T, Yang B, Cheng C, Sakurai K (2013) Efficient computing over gf(\(2^{16}\)) using graphics processing unit. In: Barolli L, You I, Xhafa F, Leu F, Chen H (eds) Seventh international conference on innovative mobile and internet services in ubiquitous computing, IMIS 2013, Taichung, Taiwan, July 3–5, 2013. IEEE Computer Society, pp 843–846. https://doi.org/10.1109/IMIS.2013.151
Toolkit C (2017) Cuda toolkit documentation. NVIDIA developer zone. http://docs.nvidia.com/cuda/index.html. Accessed 19 Dec 2017
Tsujii S, Itoh T, Fujioka A, Kurosawa K, Matsumoto T (1987) Public-key cryptosystem based on the difficulty of solving a system of nonlinear equations. Electron Lett 23(11):558–560
Wright AM (2000) The impact of quantum computing on cryptography. Netw Secur 2000(9):13–15
Acknowledgements
The authors are supported by the National Natural Sciences Foundation of China under Grant No. 61572028, National Cryptography Development Fund (MMJJ20180206), the Project of Science and Technology of Guangdong (2016B010125002), and the Project of Science and Technology of Guangzhou (201802010044). Weidong Qiu is supported by the Program of Shanghai Technology Research Leader under grant 16XD1424400.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by B. B. Gupta.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Liao, G., Gong, Z., Huang, Z. et al. A generic optimization method of multivariate systems on graphic processing units. Soft Comput 22, 7857–7864 (2018). https://doi.org/10.1007/s00500-018-3507-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3507-0