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

Designs Codes and Cryptography

Quantum security of Trojan message attacks on Merkle–Damgård hash construction

Ying Xu, Xiaoni Du, Jian Xiao Zou

Published Dec 18, 2024• 0 citations
Publisher
DOI
10.1007/s10623-024-01538-z

Related papers

Evaluating the Security of Merkle-Damgård Hash Functions and Combiners in Quantum Settings

Zhenzhen Bao, Jian Guo, Shun Li +1 more

Lecture notes in computer science•Jan 1, 2022•7 citations

The Impossibility of Post-quantum Public Indifferentiability for Merkle-Damgård

Akinori Hosoyamada

Lecture notes in computer science•Jan 1, 2026•0 citations

Quantum Collision Resistance of Double-Block-Length Hashing

Shoichi Hirose, Hidenori KUWAKADO

In 2005, Nandi introduced a class of double-block-length compression functions hπ (x) := (h(x) , h( π(x) ) ), where h is a random oracle with an n-bit output and π is a non-cryptographic public permutation. Nandi demonstrated that the collision resistance of hπ is optimal if π has no fixed point in the classical setting. Our study explores the collision resistance of hπ and the Merkle-Damåard hash function using hπ in the quantum random oracle model. Firstly, we reveal that the quantum collision resistance of hπ may not be optimal even if π has no fixed point. If π is an involution, then a colliding pair of inputs can be found for hπ with only O(2n/2) queries by the Grover search. Secondly, we present a sufficient condition on π for the optimal quantum collision resistance of hπ. This condition states that any collision attack needs Ω(22n/3) queries to find a colliding pair of inputs. The proof uses the recent technique of Zhandry's compressed oracle. Thirdly, we show that the quantum collision resistance of the Merkle-Damgård hash function using hπ can be optimal even if π is an involution. Finally, we discuss the quantum collision resistance of double-block-length compression functions using a block cipher.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 3, 2024•1 citation

TROJAN HORSE ATTACKING STRATEGY ON QUANTUM CRYPTOGRAPHY

Guihua Zeng

Solvay Conference on Physics•Aug 1, 2003•2 citations

Trojan Horse Attack Strategy on Quantum Private Communication

Jinye Peng, Guangqiang He, Jin Xiong +1 more

Lecture notes in computer science•Jan 1, 2006•1 citation

An Innovative Dual-Layer RSA Encryption Model with Merkle Trees for Quantum Resistance and Data Integrity Protection

D Maalini, Arockia Mary P, P Hemanath +3 more

The emergence of quantum computing threatens traditional cryptographic systems, and therefore quantum-resistant solutions are essential. This project proposes a Dual-Layer RSA Encryption Model enhanced with Merkle Trees to ensure quantum resistance and data integrity. The model integrates traditional RSA encryption with lattice-based post-quantum cryptographic primitives to protect against quantum attacks such as Shor's and Grover's algorithms. For supplementary security, Merkle Trees arrange quantum-secure hashes of ciphertext blocks of encrypted data, with the Merkle root as a non-changing anchor point for effective data verification. The model uses hybrid key management, including RSA and quantum-resistant cryptography, along with Merkle proof-based verification for effective integrity verification. One of the advantages of this approach is that it is quantum-resistant, which safeguards information against future quantum attacks while still being able to verify efficiently. It is very scalable, thus being suitable for secure data storage, financial transactions, and IoT networks. In addition, its backward compatibility with RSA-based schemes makes it easily compatible with existing encryption systems. With the use of Merkle Trees in hash-based authentication, the system optimizes performance, particularly in high-throughput environments like cloud storage and distributed ledgers. The hybrid cryptography model is designed to secure current and future threats against cyber attacks, yielding a long-term security model. With advancements in quantum computing technology, this forward-looking approach forms a solid framework for securing confidential information and conducting secure communication. By being scalable, efficient, and responsive, this model provides a quantum-proof encryption solution for industries to meet the quantum future.

International Conference on Artificial Intelligence and Machine Learning Applications Theme: Healthcare and Internet of Things (AIMLA)•Apr 29, 2025•0 citations
In 2005, Nandi introduced a class of double-block-length compression functions hπ (x) := (h(x) , h( π(x) ) ), where h is a random oracle with an n-bit output and π is a non-cryptographic public permutation. Nandi demonstrated that the collision resistance of hπ is optimal if π has no fixed point in the classical setting. Our study explores the collision resistance of hπ and the Merkle-Damåard hash function using hπ in the quantum random oracle model. Firstly, we reveal that the quantum collision resistance of hπ may not be optimal even if π has no fixed point. If π is an involution, then a colliding pair of inputs can be found for hπ with only O(2n/2) queries by the Grover search. Secondly, we present a sufficient condition on π for the optimal quantum collision resistance of hπ. This condition states that any collision attack needs Ω(22n/3) queries to find a colliding pair of inputs. The proof uses the recent technique of Zhandry's compressed oracle. Thirdly, we show that the quantum collision resistance of the Merkle-Damgård hash function using hπ can be optimal even if π is an involution. Finally, we discuss the quantum collision resistance of double-block-length compression functions using a block cipher.
The emergence of quantum computing threatens traditional cryptographic systems, and therefore quantum-resistant solutions are essential. This project proposes a Dual-Layer RSA Encryption Model enhanced with Merkle Trees to ensure quantum resistance and data integrity. The model integrates traditional RSA encryption with lattice-based post-quantum cryptographic primitives to protect against quantum attacks such as Shor's and Grover's algorithms. For supplementary security, Merkle Trees arrange quantum-secure hashes of ciphertext blocks of encrypted data, with the Merkle root as a non-changing anchor point for effective data verification. The model uses hybrid key management, including RSA and quantum-resistant cryptography, along with Merkle proof-based verification for effective integrity verification. One of the advantages of this approach is that it is quantum-resistant, which safeguards information against future quantum attacks while still being able to verify efficiently. It is very scalable, thus being suitable for secure data storage, financial transactions, and IoT networks. In addition, its backward compatibility with RSA-based schemes makes it easily compatible with existing encryption systems. With the use of Merkle Trees in hash-based authentication, the system optimizes performance, particularly in high-throughput environments like cloud storage and distributed ledgers. The hybrid cryptography model is designed to secure current and future threats against cyber attacks, yielding a long-term security model. With advancements in quantum computing technology, this forward-looking approach forms a solid framework for securing confidential information and conducting secure communication. By being scalable, efficient, and responsive, this model provides a quantum-proof encryption solution for industries to meet the quantum future.