Tao Shang

With the rapid development of quantum computing technology, the classical cryptosystem will face a significant threat. It is an urgent security issue to study the security impact of quantum computing on classical cryptosystems and provide reliable cryptographic primitives for the post-quantum era. A powerful way to solve this problem is to quantize the classical cryptanalysis tools and use the improved versions for cryptanalysis. In this paper, we propose a quantum zero correlation analysis algorithm based on the Bernstein-Vazirani and Grover algorithms. It can find zero correlation linear hulls for Feistel and SPN ciphers. We prove the correctness of the algorithm and analyze its complexity. Compared with the classical algorithms, the proposed quantum algorithm has significant advantages when the number of encryption rounds of block ciphers is large. Moreover, compared with the existing quantum zero correlation linear analysis, the proposed algorithm is more efficient and does not depend on the algebraic characteristics of the target cipher, which makes the algorithm has more flexible application scenarios.

In distributed systems, Byzantine consensus serves as a practical approach to addressing the Byzantine general problem. Previous research has exploited quantum resources to develop quantum-detectable Byzantine consensus protocols, aiming to surpass the 1/3 fault-tolerance bound. However, these consensus protocols are designed under the assumption of secure channel. They ignored malicious participants' attacks on the communication process. In this paper, we introduce a new quantum protocol for quantum Byzantine consensus utilizing the full quantum one-way function, which is the foundation for generating verification state in list distribution phase and secure message in agreement phase. By relying on the quantum circuit of the full quantum one-way function, the honest participants are able to reach consensus, while the malicious participants are effectively detected. In order to enhance the scalability of the proposed quantum Byzantine consensus protocol, we categorize the participants into three-member groups when the number of participants is n > 3. Meanwhile, the election of commander is introduced in agreement phase. In the proposed multi-party quantum Byzantine consensus protocol, the full quantum one-way function verifies the honesty of the participants both in list distribution phase and agreement phase. Security analysis demonstrates that the proposed multiparty quantum Byzantine consensus protocol is secure against quantum attacks and the dishonest behaviors of participants.