THE IDEAS OF REDUCING THE SIGNATURE SIZE IN HASH-BASED DIGITAL SIGNATURES
Автор: Giorgi Labadze, Irakli Pirtskhalava
Организация: Georgian Technical University, Scientific Cyber Security Association
Ключевые слова: hash-based, digital signatures, signature size
Аннотация. The data encryption has been the traditional way of ensuring the different types of sensitive data. It is expected the massive release of quantum computers in the near future. Quantum computers can break the classical crypto schemes. Therefore the classical encryption systems have become vulnerable to quantum computer-based attacks. This involves the research efforts that look for encryption schemes that are immune to quantum computers-based attacks. This paper describes one of the few digital signature schemes, which is essentially immune to quantum computers-based attacks. These schemes have the efficiency problems. The biggest problem of this scheme is the large size of the signature. The paper offers the idea and the methodology of reducing the size of the signature size.
1.Gagnidze A., Iavich M., Iashvili G., (2017) Analysis of post quantum cryptography use in practice. Bulletin of the Georgian National Academy of Sciences, 2, 12: 29-36
2.Gagnidze, A., Iavich, M., Iashvili, G., Novel version of merkle cryptosystem, Bulletin of the Georgian National Academy of Sciences, 2017
3.Iavich, M., Gagnidze, A., Iashvili, G., Hash based digital signature scheme with integrated TRNG, CEUR Workshop Proceedings, 2018
4.Paquin C., Stebila D., Tamvada G. (2020) Benchmarking Post-quantum Cryptography in TLS. In: Ding J., Tillich JP. (eds) Post-Quantum Cryptography. PQCrypto 2020. Lecture Notes in Computer Science, vol 12100. Springer, Cham. https://doi.org/10.1007/978-3-030-44223-1_5
5.Ajtai, M. (1986) Generating hard instances of lattice problems. In Complexity of computations and proofs, volume 13 of Quad. Mat., pp. 1-32. Dept. Math., Seconda Univ. Napoli, Caserta (2004). Preliminary version in STOC 1996. 8. Babai, L.: On Lovász lattice reduction and the nearest lattice point problem. Combinatorica, 6:1*13
6.Buchmann J., Dahmen E., Ereth S., Hülsing A., Rückert M. (2011) On the Security of the Winternitz One-Time Signature Scheme In: Nitaj A., Pointcheval D. (eds) Progress in Cryptology – AFRICACRYPT 2011. Lecture Notes in Computer Science, vol 6737. Springer, Berlin, Heidelberg
7.R. Merkle. (1979) Secrecy, authentication and public key systems / A certified digital signature Ph.D. dissertation, Dept. of Electrical Engineering, Stanford University.
8.Hu Z., Gnatyuk S., Okhrimenko T., Tynymbayev S. and Iavich M. High-speed and secure PRNG for cryptographic applications, International Journal of Computer Network and Information Security, Issue 12 (3), pp. 1-10, 2020