Abstract
Today scientists are actively working on the creation of quantum computers. Quantum computers will be able to solve the problem of factoring the large numbers. So, quantum computers can break the crypto system RSA, which is used in many products. Hash based digital signatures are the alternative to RSA. These systems use cryptographic hash function. The security of these systems depends on the resistance to collisions of the hash functions that they use. The paper analyzes hash based digital signature schemes. It analyzes the improvements of the scheme. Fractal Merkle algorithm is also analyzed. This algorithm can be considered as the static one, because it does not depend on the number of the threads in CPU. Authors have offered the post-quantum algorithm, which uses the threads of CPU in the parallel mode. The mathematical model of this algorithm and the pseudo code of its implementation are offered in the paper. This algorithm was analyzed and is shown that this algorithm provides rather good speed up, and can be implement to provide post-quantum security in modern information and communication systems.
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
Similar content being viewed by others
References
Iavich, M., Gagnidze, A., Iashvili, G., Gnatyuk, S., Vialkova, V.: Lattice based Merkle. In: CEUR Workshop Proceedings, vol. 2470, pp. 13–16 (2019)
Gagnidze, A., Iavich, M., Iashvili, G.: Improvement of hash based digital signature. In: CEUR Workshop Proceedings (CEUR-WS.org) (2018)
Buchmann, J., Dahmen, E., Schneider, M.: Merkle tree traversal revisited. In: 2nd International Workshop on Post-Quantum Cryptography - PQCrypto 2008, LNCS, vol. 5299, pp. 63–77. Springer, Heidelberg (2008)
Gagnidze, A.G., Iavich, M.P., Iashvili, G.U.: Analysis of post quantum cryptography use in practice. Bull. Georgian Natl. Acad. Sci. 11(2), 29–36 (2017)
Ajtai, M.: Generating hard instances of lattice problems. In: Complexity of computations and proofs, Quad. Mat., vol. 13, pp. 1–32. Dept. Math., Seconda Univ. Napoli, Caserta (2004). Preliminary version in STOC 1996
Babai, L.: On Lovász lattice reduction and the nearest lattice point problem. Combinatorica 6, 1–13 (1986)
Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. Technical report TR96-056, Electronic Colloquium on Computational Complexity (ECCC) (1996)
Coron, J.S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damgård revisited: how to construct a hash function. In: Shoup, V. (eds.) Advances in Cryptology – CRYPTO 2005. Lecture Notes in Computer Science, vol. 3621. Springer, Heidelberg (2005)
Li, H., Lu, R., Zhou, L., Yang, B., Shen, X.: An Efficient Merkle-Tree-Based Authentication Scheme for Smart Grid. IEEE (2013)
Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle tree representation and traversal. In: Joye, M. (ed.) Topics in Cryptology – CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol. 2612. Springer, Heidelberg (2003)
Buchmann, J., Dahmen, E., Schneider, M.: Merkle tree traversal revisited. In: Buchmann, J., Ding, J. (eds.) Post-Quantum Cryptography. PQCrypto 2008. Lecture Notes in Computer Science, vol. 5299. Springer, Heidelberg (2008)
Hu, Z., Gnatyuk, S., Okhrimenko, T., Kinzeryavyy, V., Iavich, M., Yubuzova, Kh.: High-speed privacy amplification method for deterministic quantum cryptography protocols using pairs of entangled qutrits. In: CEUR Workshop Proceedings, vol. 2393, pp. 810–821 (2019)
Hu, Z., Gnatyuk, S., Kovtun, M., Seilova, N.: Method of searching birationally equivalent Edwards curves over binary fields. In: Advances in Intelligent Systems and Computing, vol. 754, pp. 309–319 (2019)
Gaeini, A., Mirghadri, A., Jandaghi, G., Keshavarzi, B.: Comparing some pseudo-random number generators and cryptography algorithms using a general evaluation pattern. Int. J. Inf. Technol. Comput. Sci. (IJITCS) 8(9), 25–31 (2016)
Dawood, O.A., Rahma, A.M., Hossen, A.M.: The new block cipher design (Tigris Cipher). Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 7(12), 10–18 (2015)
Gupta, L., Garg, H., Samad, A.: An improved DNA based security model using reduced cipher text technique. Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 11(7), 13–20 (2019)
Acknowledgement
This work was carried out as a part of PHDF-19-519 and the grant financed by Caucasus University as well as part of Young Scientist Project â„–Â 0117U006770 of the Ministry of Education and Science of Ukraine.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Iavich, M., Gnatyuk, S., Arakelian, A., Iashvili, G., Polishchuk, Y., Prysiazhnyy, D. (2021). Improved Post-quantum Merkle Algorithm Based on Threads. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds) Advances in Computer Science for Engineering and Education III. ICCSEEA 2020. Advances in Intelligent Systems and Computing, vol 1247. Springer, Cham. https://doi.org/10.1007/978-3-030-55506-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-030-55506-1_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-55505-4
Online ISBN: 978-3-030-55506-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)