Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Radiotekhnika

Improved Post-quantum Hash Based One-Time Key Mechanism

Yuriy Gorbenko, Kateryna Isirova

Published Dec 22, 2017• 0 citations
Publisher

Abstract

The necessity of developing new electronic signature mechanisms, which will be relevant and can be applied in the post-quantum period, is grounded. The main properties of existing mechanisms, their advantages and disadvantages are given. An improved POTS mechanism is proposed. The essence is described, research of properties by criteria of complexity - cryptographic stability is presented, advantages and disadvantages and conditions and possibilities of its use in various applications of the post-quantum period are determined.

DOI
10.30837/rt.2017.4.191.03

Related papers

IMPROVED MECHANISM OF ONE-TIME KEYS FOR POST-QUANTUM PERIOD BASED ON THE HASHING FUNCTIONS

Yuriy Gorbenko, Kateryna Isirova

Necessity of developing the new electronic signature mechanisms, which will be relevant and can be applied in the post-quantum period, is grounded. The main properties of existing mechanisms, their advantages and disadvantages are given. An improved POTS mechanism is proposed. The essence is described, research of properties by criteria of complexity - cryptographic stability is presented, advantages and disadvantages, and conditions and possibilities of its use in various applications of the post-quantum period are determined.

Telecommunications and Radio Engineering•Jan 1, 2018•2 citations

ANALYSIS OF POTENTIAL POST-QUANTUM SCHEMES OF HASH-BASED DIGITAL SIGNATUR

Yuriy Gorbenko, Т. V. Меlnik, І.Д. Горбенко

The results of the analysis of electronic signatures with one-time keys for the post-quantum period are given. The requirements are justified and an improved mechanism of electronic signature is presented for the criteria of spatial complexity of keys and signatures. A model of the violator and threats is proposed. The main types of attacks on the electronic signature with one-time keys are substantiated. The main relations of the post-quantum cryptanalysis complexity estimation are presented. The main recommendations and the main spheres of using the electronic signature in the post-quantum period are given.

Telecommunications and Radio Engineering•Jan 1, 2018•1 citation

Аналіз потенційних постквантових механізмів електронних підписів на основі геш-функцій

Ю.І. Горбенко, Т. V. Меlnik, І.Д. Горбенко

The results of the analysis of electronic signatures with one-time keys for the post-quantum period are given. The requirements are justified and an improved mechanism of electronic signature is presented for the criteria of spatial complexity of keys and signatures. A model of the violator and threats is proposed. The main types of attacks on the electronic signature with one-time keys are substantiated. The main relations of the post-quantum cryptanalysis complexity estimation are presented. The main recommendations and the main spheres of using the electronic signature in the post-quantum period are given.

Radiotekhnika•Jan 1, 2017•0 citations

CRYPTOGRAPHIC PROTOCOL OF VERIFIABLY ENCRYPTED SIGNATURE WITH POSSIBILITY OF VERIFICATION AFTER A SPECIFIED TIME

Yerzhan N. Seitkulov, R. M. Ospanov, B. B. Yergaliyeva +2 more

One of the modern directions in the field of information security is post-quantum cryptography. Its purpose is to develop new quantum-resistant cryptographic algorithms. An important section of post-quantum cryptography is electronic digital signature algorithms. There are a number of different approaches to designing post-quantum signatures. One of the main approaches to designing post-quantum cryptographic digital signature algorithms is hash-based post-quantum digital signature schemes. Hash-based post-quantum digital signature schemes are one of the main types of post-quantum cryptographic digital signature algorithms. They are quite efficient and provably secure. Their reliable security has been established against both classical and quantum attacks. There are many types of digital signatures for solving various information security problems, such as group signatures, ring signatures, blind signatures, verifiably encrypted signatures, etc. This paper proposes a new cryptographic protocol of verifiably encrypted signature with possibility of verification after a specified time based on the post-quantum cryptographic algorithm of hash-based digital signature, TANBA-SPHINCS+. The protocol is an efficient combination of the postquantum digital signature algorithm TANBA-SPHINCS+, the cryptographic protocol providing data encryption for a specified time, ECTLC, and the verifiably encrypted signature scheme.

Herald of Kazakh-British technical university•Mar 29, 2026•0 citations

Comparative analysis of post-quantum digital signature protocols based on hash functions

Олексій Башук

In the era of active information technologies and device development, the emergence of portable and general-purpose quantum computers is only a matter of time. And although the benefit of their many times greater efficiency, compared to ordinary bit computers, will be obvious, at the same time, they will bring many vulnerabilities to modern algorithms of cryptography and cybersecurity. To prevent this from happening, society has already started researching post-quantum protocols to replace modern ones. Digital signature protocols were no exception. Thus, one of the approaches was constructing post-quantum digital signature protocols based on hash functions. The first representatives were schemes of one-time signatures based on hash functions, which were protected from the capabilities of quantum computers but had the obvious disadvantage of one-time use. The most famous is the so-called Lamport one-time signature. However, this disadvantage of one-time use has been solved by proposing different schemes of multi-time digital signatures based on the creation and use of many one-time signatures. Thus, chain-based and tree-based schemes of multi-time signatures were proposed. This work is devoted to the implementation and comparison of various multi-time signature schemes. During the research, theoretical estimates of memory usage and time required for the operations of various schemes were given. Further implementation of these schemes and final measurements showed the correspondence of theoretical estimates with empirical results and clearly demonstrated the advantages and disadvantages of different schemes. Thus, tree-based schemes showed the best performance, especially those where the tree is built sequentially. However, in certain cases, it makes sense to use a tree with full-depth construction. Due to the relative novelty and small amount of research in this field, multi-time digital signatures have much room for further research, for example, considering N-ary trees and comparing them with binary ones.

Bulletin of Taras Shevchenko National University of Kyiv Series Physics and Mathematics•Jun 5, 2026•0 citations

Comparative Analysis of Post-Quantum Asymmetric Encrypt Algorithms

V. V. Onoprienko, Volodymyr Ponomar

Due to the development of technologies for quantum computing and the introduction of quantum computer, there is a threat to the current state of protection of cryptographic systems with a public key. With an advent of quantum computer that would have the volume of register required for the methods of quantum cryptanalysis, the stability of existing crypto algorithms will significantly degrade. This necessitates the creation of algorithms resistant to the methods of quantum cryptanalysis. The European project «New European Schemes for Signatures, Integrity, and Encryptions» (NESSIE) and the National Institute of Standards and Technologies (NIST) of the USA announced a start of recruiting the applicants for the contest of post-quantum algorithms whose standards are planned to be adopted over 2020–2022. In order to compare, a procedure for evaluation was selected based on integral assessments of unconditional and conditional criteria. An analysis was conducted among the algorithms that fulfilled general unconditional criteria. As conditional criteria, we chose numerical characteristics of algorithms. In addition, additional unconditional criteria were put forward.A relevant task is the comparative analysis and evaluation of a possibility to use the post-quantum mechanisms, which are represented by the algorithms that already exist, depending on the conditions of applying them. At present, only the possibility of using the appropriate crypto transformations over a post-quantum period is being examined, but the analysis of advantages of one over another has not been run yet. In addition, it is necessary to evaluate the very possibility to use such algorithms taking into account those constraints that are imposed by the existing information systems.Results of present research allow us to understand current state in the development of post-quantum crypto algorithms and to predict their possible further development.This forecast is important in that the post-quantum cryptographic mechanisms represent a new stage in the development and use of cryptography. In addition, the practical value of the research consists in obtaining the evaluation for post-quantum algorithms.

Mathematical and computer modelling Series Technical sciences•Jun 20, 2019•0 citations
The necessity of developing new electronic signature mechanisms, which will be relevant and can be applied in the post-quantum period, is grounded. The main properties of existing mechanisms, their advantages and disadvantages are given. An improved POTS mechanism is proposed. The essence is described, research of properties by criteria of complexity - cryptographic stability is presented, advantages and disadvantages and conditions and possibilities of its use in various applications of the post-quantum period are determined.
Necessity of developing the new electronic signature mechanisms, which will be relevant and can be applied in the post-quantum period, is grounded. The main properties of existing mechanisms, their advantages and disadvantages are given. An improved POTS mechanism is proposed. The essence is described, research of properties by criteria of complexity - cryptographic stability is presented, advantages and disadvantages, and conditions and possibilities of its use in various applications of the post-quantum period are determined.
The results of the analysis of electronic signatures with one-time keys for the post-quantum period are given. The requirements are justified and an improved mechanism of electronic signature is presented for the criteria of spatial complexity of keys and signatures. A model of the violator and threats is proposed. The main types of attacks on the electronic signature with one-time keys are substantiated. The main relations of the post-quantum cryptanalysis complexity estimation are presented. The main recommendations and the main spheres of using the electronic signature in the post-quantum period are given.
The results of the analysis of electronic signatures with one-time keys for the post-quantum period are given. The requirements are justified and an improved mechanism of electronic signature is presented for the criteria of spatial complexity of keys and signatures. A model of the violator and threats is proposed. The main types of attacks on the electronic signature with one-time keys are substantiated. The main relations of the post-quantum cryptanalysis complexity estimation are presented. The main recommendations and the main spheres of using the electronic signature in the post-quantum period are given.
One of the modern directions in the field of information security is post-quantum cryptography. Its purpose is to develop new quantum-resistant cryptographic algorithms. An important section of post-quantum cryptography is electronic digital signature algorithms. There are a number of different approaches to designing post-quantum signatures. One of the main approaches to designing post-quantum cryptographic digital signature algorithms is hash-based post-quantum digital signature schemes. Hash-based post-quantum digital signature schemes are one of the main types of post-quantum cryptographic digital signature algorithms. They are quite efficient and provably secure. Their reliable security has been established against both classical and quantum attacks. There are many types of digital signatures for solving various information security problems, such as group signatures, ring signatures, blind signatures, verifiably encrypted signatures, etc. This paper proposes a new cryptographic protocol of verifiably encrypted signature with possibility of verification after a specified time based on the post-quantum cryptographic algorithm of hash-based digital signature, TANBA-SPHINCS+. The protocol is an efficient combination of the postquantum digital signature algorithm TANBA-SPHINCS+, the cryptographic protocol providing data encryption for a specified time, ECTLC, and the verifiably encrypted signature scheme.
In the era of active information technologies and device development, the emergence of portable and general-purpose quantum computers is only a matter of time. And although the benefit of their many times greater efficiency, compared to ordinary bit computers, will be obvious, at the same time, they will bring many vulnerabilities to modern algorithms of cryptography and cybersecurity. To prevent this from happening, society has already started researching post-quantum protocols to replace modern ones. Digital signature protocols were no exception. Thus, one of the approaches was constructing post-quantum digital signature protocols based on hash functions. The first representatives were schemes of one-time signatures based on hash functions, which were protected from the capabilities of quantum computers but had the obvious disadvantage of one-time use. The most famous is the so-called Lamport one-time signature. However, this disadvantage of one-time use has been solved by proposing different schemes of multi-time digital signatures based on the creation and use of many one-time signatures. Thus, chain-based and tree-based schemes of multi-time signatures were proposed. This work is devoted to the implementation and comparison of various multi-time signature schemes. During the research, theoretical estimates of memory usage and time required for the operations of various schemes were given. Further implementation of these schemes and final measurements showed the correspondence of theoretical estimates with empirical results and clearly demonstrated the advantages and disadvantages of different schemes. Thus, tree-based schemes showed the best performance, especially those where the tree is built sequentially. However, in certain cases, it makes sense to use a tree with full-depth construction. Due to the relative novelty and small amount of research in this field, multi-time digital signatures have much room for further research, for example, considering N-ary trees and comparing them with binary ones.
Due to the development of technologies for quantum computing and the introduction of quantum computer, there is a threat to the current state of protection of cryptographic systems with a public key. With an advent of quantum computer that would have the volume of register required for the methods of quantum cryptanalysis, the stability of existing crypto algorithms will significantly degrade. This necessitates the creation of algorithms resistant to the methods of quantum cryptanalysis. The European project «New European Schemes for Signatures, Integrity, and Encryptions» (NESSIE) and the National Institute of Standards and Technologies (NIST) of the USA announced a start of recruiting the applicants for the contest of post-quantum algorithms whose standards are planned to be adopted over 2020–2022. In order to compare, a procedure for evaluation was selected based on integral assessments of unconditional and conditional criteria. An analysis was conducted among the algorithms that fulfilled general unconditional criteria. As conditional criteria, we chose numerical characteristics of algorithms. In addition, additional unconditional criteria were put forward.A relevant task is the comparative analysis and evaluation of a possibility to use the post-quantum mechanisms, which are represented by the algorithms that already exist, depending on the conditions of applying them. At present, only the possibility of using the appropriate crypto transformations over a post-quantum period is being examined, but the analysis of advantages of one over another has not been run yet. In addition, it is necessary to evaluate the very possibility to use such algorithms taking into account those constraints that are imposed by the existing information systems.Results of present research allow us to understand current state in the development of post-quantum crypto algorithms and to predict their possible further development.This forecast is important in that the post-quantum cryptographic mechanisms represent a new stage in the development and use of cryptography. In addition, the practical value of the research consists in obtaining the evaluation for post-quantum algorithms.