Modified Hash to Obtain Random Subset-Tree (MHORST) Using Merkle Tree and Mersenne Twister
Open Access
- 17 August 2025
- journal article
- Published by Sunan Gunung Djati State Islamic University of Bandung in Jurnal Online Informatika
- Vol. 10 (2) , 384-394
Abstract
The development of quantum computing triggers new challenges in data security, particularly in addressing attacks that can solve complex mathematical problems on the fly. Several hash-based data security methods have been proposed to deal with this threat, one of them being Hash to Obtain Random Subset-Tree (HORST). However, HORST has drawbacks, such as low security, because it only uses one hash round. The security of HORST is already improved by Hash to Obtain Random Subset and Integer Composition (HORSIC). However, HORSIC’s execution time is significantly increased. The problem of this research is the low-security HORST and the high execution time of HORSIC. This research proposes a new method, Modified Hash to Obtain Random Subset-Tree (MHORST), which aims to improve the security of HORST and reduce the execution time to less than HORSI’s. MHORST uses Merkle tree, SHA-256 hashes, and Mersenne Twister to build public keys and digital signatures. Based on the experiment results, MHORST reduces the signing time by more than 3.3 times compared to HORST. MHORST reduces the verification time by more than 1.1 times HORST and 17 times HORSIC. Although the security level of MHORST decreases slightly compared to HORSIC, this method is still more secure than HORST against signature forgery.Keywords
This publication has 13 references indexed in Scilit:
- Beyond Classical Cryptography: A Systematic Review of Post-Quantum Hash-Based Signature Schemes, Security, and OptimizationsIEEE Access, 2024
- Winternitz stack protocols for embedded systems and IoTCybersecurity, 2024
- Improved Algorithms for Integer Complexity2024
- One-time universal hashing quantum digital signatures without perfect keysPhysical Review Applied, 2023
- EVOLUTION AND ANALYSIS OF SECURED HASH ALGORITHM (SHA) FAMILYMalaysian Journal of Computer Science, 2022
- Hash-based signature revisitedCybersecurity, 2022
- Smart Digital Signatures (SDS): A post-quantum digital signature scheme for distributed ledgersFuture Generation Computer Systems, 2020
- Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security2020
- Strengthening fawkescoin against double spending attack using merkle tree2019
- Improving Stateless Hash-Based Signatures2018