Gaoli Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Gaoli Wang has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Fukang Liu
Institute of Science Tokyo
6 shared publications - Jianqiang Ni
Shanghai Key Laboratory of Trustworthy Computing, Software Engineering Institute, East China Normal University, Shanghai, China
6 shared publications Fukang Liu
Institute of Science Tokyo, Tokyo, Japan
5 shared publications- Yingxin Li
Shanghai Key Laboratory of Trustworthy Computing, Software Engineering Institute, East China Normal University, Shanghai, China
5 shared publications - Siwei Sun
School of Cryptology, University of Chinese Academy of Sciences, Beijing, China
4 shared publications - Xiaoyang Dong
Tsinghua University
4 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Springer Nature
- p. 289-320
Pushing the Limit of Memory-Efficient Collision Attack Framework for SHA-2
- 11 August 2026
- Published by Springer Nature
- p. 289-320
Open AccessPushing the Limit of Memory-Efficient Collision Attack Framework for SHA-2
- 27 July 2026
- Published by Springer Nature in Journal of Cryptology
- Vol. 39 (4) , 27
New Records in Collision Attacks on SHA-2
- 27 July 2026
- Published by Springer Nature in Journal of Cryptology
- Vol. 39 (4) , 27
New Records in Collision Attacks on SHA-2
- 2 June 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (6) , 123
Tracking Algebraic Degree with Exponent Sets: Higher-Order Differential Attacks on FHE-Friendly Cipher ${\textsf {Yu}_{2}\textsf {X}}$- 2 June 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (6) , 123
Tracking Algebraic Degree with Exponent Sets: Higher-Order Differential Attacks on FHE-Friendly Cipher ${\textsf {Yu}_{2}\textsf {X}}$- 20 February 2026
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 20 (10) , 2010812
New SAT-based model for constructing linear layers with good cryptographic properties and implementation
- 20 February 2026
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 20 (10) , 2010812
New SAT-based model for constructing linear layers with good cryptographic properties and implementation
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9732-9752
Practical Key Collision on AES and Kiasu-BC
The key collision attack was proposed as an open problem in key-committing security in Authenticated Encryption (AE) schemes like AES-GCM and ChaCha20Poly1305. In ASIACRYPT 2024, Taiyama et al. introduce a novel type of key collision—target-plaintext key collision (TPKC) for AES. Depending on whether the plaintext is fixed, TPKC can be divided into fixed-TPKC and free-TPKC, which can be directly converted into collision attacks and semi-free-start collision attacks on the Davies-Meyer (DM) hashing mode. In this paper, we propose a new rebound attack framework leveraging a time-memory tradeoff strategy, enabling practical key collision attacks with optimized complexity. We also present an improved automatic method for finding rebound-friendly differential characteristics by controlling the probabilities in the inbound and outbound phases, allowing the identified characteristics to be directly used in rebound-based key collision attacks. Our analysis reveals that the 2-round AES-128 fixed-TPKC attack proposed by Taiyama et al. is, in fact, a free-TPKC attack. This distinction is significant, as fixed-TPKC attacks are substantially more difficult than their free-TPKC counterparts. By integrating our improved automatic method with a new rebound attack framework, we successfully identify a new differential characteristic for the 2-round AES-128 fixed-TPKC attack and develope the first practical fixed-TPKC attack against 2-round AES-128. Additionally, we present practical fixed-TPKC attacks against 5-round AES-192 and 3-round Kiasu-BC, along with a practical free-TPKC attack against 6-round Kiasu-BC. Furthermore, we reduce time complexities for free-TPKC and fixed-TPKC attacks on other AES variants.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9732-9752
Practical Key Collision on AES and Kiasu-BC
The key collision attack was proposed as an open problem in key-committing security in Authenticated Encryption (AE) schemes like AES-GCM and ChaCha20Poly1305. In ASIACRYPT 2024, Taiyama et al. introduce a novel type of key collision—target-plaintext key collision (TPKC) for AES. Depending on whether the plaintext is fixed, TPKC can be divided into fixed-TPKC and free-TPKC, which can be directly converted into collision attacks and semi-free-start collision attacks on the Davies-Meyer (DM) hashing mode. In this paper, we propose a new rebound attack framework leveraging a time-memory tradeoff strategy, enabling practical key collision attacks with optimized complexity. We also present an improved automatic method for finding rebound-friendly differential characteristics by controlling the probabilities in the inbound and outbound phases, allowing the identified characteristics to be directly used in rebound-based key collision attacks. Our analysis reveals that the 2-round AES-128 fixed-TPKC attack proposed by Taiyama et al. is, in fact, a free-TPKC attack. This distinction is significant, as fixed-TPKC attacks are substantially more difficult than their free-TPKC counterparts. By integrating our improved automatic method with a new rebound attack framework, we successfully identify a new differential characteristic for the 2-round AES-128 fixed-TPKC attack and develope the first practical fixed-TPKC attack against 2-round AES-128. Additionally, we present practical fixed-TPKC attacks against 5-round AES-192 and 3-round Kiasu-BC, along with a practical free-TPKC attack against 6-round Kiasu-BC. Furthermore, we reduce time complexities for free-TPKC and fixed-TPKC attacks on other AES variants.
- Open Access
- 25 September 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2025 (3) , 633-692
Linear Cancellations in the MitM Attacks on Sponge Functions
At EUROCRYPT 2023, Qin et al. proposed the MitM attack framework on sponge functions by separating the message bits into two sets of neutral bits. By assigning bit cancellations on one of the two sets, the states of the two sets can be computed independently and then filtered by some matching equations. To solve the bit cancellations, Qin et al. exhaustively compute the cancellations of all message bits, and store them in a huge hash table, which leads to attacks with huge memory. In this paper, we separate the bit cancellations into linear and nonlinear cancellations for the MitM attacks, where the linear cancellations are solved by Gaussian elimination, and only the nonlinear cancellations are dealt with the hash table. Hence, the memory cost is significantly reduced. In order to search new attacks with efficient memory (fewer nonlinear cancellations and more linear cancellations), we propose a new MILP model whose encoding scheme can distinguish linear and nonlinear cancellations. Besides, dedicated tricks such as the so-called weak-diffusion structure and two-stage search are proposed to further accelerate solving the MILP models.Finally, the memory complexities of MitM attacks on 4-round Keccak[1024], 3-round Xoodyak-Xof, 4-round Ascon-Xof, and full Subterranean 2.0 are reduced by 249, 259, 216, and 236, respectively. Besides, our memory-efficient approach can turn invalid MitM attacks (where memory complexity is the dominant factor in old framework) into valid MitM attacks. For example, we propose the first MitM preimage attack on 4-round Keccak[768] and the first 3-round collision attack on Xoodyak-Xof with 128-bit tag.
- 25 September 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2025 (3) , 633-692
Open AccessLinear Cancellations in the MitM Attacks on Sponge Functions
At EUROCRYPT 2023, Qin et al. proposed the MitM attack framework on sponge functions by separating the message bits into two sets of neutral bits. By assigning bit cancellations on one of the two sets, the states of the two sets can be computed independently and then filtered by some matching equations. To solve the bit cancellations, Qin et al. exhaustively compute the cancellations of all message bits, and store them in a huge hash table, which leads to attacks with huge memory. In this paper, we separate the bit cancellations into linear and nonlinear cancellations for the MitM attacks, where the linear cancellations are solved by Gaussian elimination, and only the nonlinear cancellations are dealt with the hash table. Hence, the memory cost is significantly reduced. In order to search new attacks with efficient memory (fewer nonlinear cancellations and more linear cancellations), we propose a new MILP model whose encoding scheme can distinguish linear and nonlinear cancellations. Besides, dedicated tricks such as the so-called weak-diffusion structure and two-stage search are proposed to further accelerate solving the MILP models.Finally, the memory complexities of MitM attacks on 4-round Keccak[1024], 3-round Xoodyak-Xof, 4-round Ascon-Xof, and full Subterranean 2.0 are reduced by 249, 259, 216, and 236, respectively. Besides, our memory-efficient approach can turn invalid MitM attacks (where memory complexity is the dominant factor in old framework) into valid MitM attacks. For example, we propose the first MitM preimage attack on 4-round Keccak[768] and the first 3-round collision attack on Xoodyak-Xof with 128-bit tag.
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 200-229
New Collision Attacks on Round-Reduced SHA-512
- 17 August 2025
- Published by Springer Nature
- p. 200-229
Open AccessNew Collision Attacks on Round-Reduced SHA-512
- 7 August 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (11) , 4887-4909
Exploiting output bits and the $\chi $ operation in MitM preimage attacks on Keccak- 7 August 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (11) , 4887-4909
Exploiting output bits and the $\chi $ operation in MitM preimage attacks on Keccak- 25 July 2025
- Published by Springer Nature
- p. 487-497
LLMonCAR: A Benchmark for Exploring Large Language Models on Cryptographic Algorithm Recognition
- 25 July 2025
- Published by Springer Nature
- p. 487-497
LLMonCAR: A Benchmark for Exploring Large Language Models on Cryptographic Algorithm Recognition
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 38249-38261
Security Analysis of the Lightweight Cryptographic Algorithm Sycon for IoT Devices
With the rapid proliferation of the Internet of Things (IoT), the security of IoT devices has become an increasingly critical concern, particularly in the context of lightweight cryptographic algorithms designed for resource-constrained environments. Lightweight cryptography is indispensable for ensuring the confidentiality and integrity of communications across IoT networks. This article presents a thorough security evaluation of the Sycon algorithm, focusing on its susceptibility to a range of cryptographic attacks. We begin by introducing Meet-in-the-Middle (MitM) preimage and collision attacks on 3-round and 4-round Sycon-Hash. These attacks are the first published analysis results on reduced-round Sycon-Hash. By employing a satisfiability modulo theory-based modeling approach in conjunction with the STP solver, we successfully construct and validate MitM attack paths, thereby providing novel insights into the resilience of Sycon against such threats. In addition, we propose and implement a committing attack on the 2-round Sycon-AEAD-64 using the CMT-3 framework, which uncovers potential vulnerabilities within its authenticated encryption mechanism. Our analysis not only advances the understanding of Sycon’s cryptographic robustness but also offers valuable methodologies for the future assessment of lightweight cryptographic solutions in resource-constrained contexts.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 38249-38261
Security Analysis of the Lightweight Cryptographic Algorithm Sycon for IoT Devices
With the rapid proliferation of the Internet of Things (IoT), the security of IoT devices has become an increasingly critical concern, particularly in the context of lightweight cryptographic algorithms designed for resource-constrained environments. Lightweight cryptography is indispensable for ensuring the confidentiality and integrity of communications across IoT networks. This article presents a thorough security evaluation of the Sycon algorithm, focusing on its susceptibility to a range of cryptographic attacks. We begin by introducing Meet-in-the-Middle (MitM) preimage and collision attacks on 3-round and 4-round Sycon-Hash. These attacks are the first published analysis results on reduced-round Sycon-Hash. By employing a satisfiability modulo theory-based modeling approach in conjunction with the STP solver, we successfully construct and validate MitM attack paths, thereby providing novel insights into the resilience of Sycon against such threats. In addition, we propose and implement a committing attack on the 2-round Sycon-AEAD-64 using the CMT-3 framework, which uncovers potential vulnerabilities within its authenticated encryption mechanism. Our analysis not only advances the understanding of Sycon’s cryptographic robustness but also offers valuable methodologies for the future assessment of lightweight cryptographic solutions in resource-constrained contexts.