Mengce Zheng
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
Mengce Zheng has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
Honggang Hu
CAS University of Science and Technology of China,Key Laboratory of Electromagnetic Space Information,Hefei,China
12 shared publications- Abderrahmane Nitaj
Université Caen Normandie, CNRS, Normandie Univ, LMNO UMR6139
7 shared publications - Honggang Hu
University of Science and Technology of China
7 shared publications Nenghai Yu
CAS University of Science and Technology of China,Key Laboratory of Electromagnetic Space Information,Hefei,China
7 shared publicationsFan Huang
School of Cyber Science and Technology, University of Science and Technology of China, Hefei, China
3 shared publicationsPing Wang
CAS University of Science and Technology of China,Key Laboratory of Electromagnetic Space Information,Hefei,China
3 shared publications
Latest Publications
- 7 November 2026
- Published by Springer Nature
- p. 432-452
Lattice-Based Cryptanalysis of Prime Power RSA: A Unified Framework for Linear Equations Modulo Unknown Divisors
- 7 November 2026
- Published by Springer Nature
- p. 432-452
Lattice-Based Cryptanalysis of Prime Power RSA: A Unified Framework for Linear Equations Modulo Unknown Divisors
- 20 July 2026
- Published by Springer Nature
- p. 527-547
Vulnerability Analysis of Mersenne Number-Based Post-quantum Cryptosystems in Secure Communication Networks
- 20 July 2026
- Published by Springer Nature
- p. 527-547
Vulnerability Analysis of Mersenne Number-Based Post-quantum Cryptosystems in Secure Communication Networks
- Open Access
- 18 June 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (3) , 40
A Hybrid Attack on Small Private Exponent RSA via Continued Fractions and Lattices
In this study, we propose a hybrid cryptanalytic technique targeting the RSA cryptosystem when instantiated with small private exponents. By integrating the continued fraction approach with Coppersmith’s lattice-based technique, we formulate a novel vulnerability framework. Utilizing an innovative relationship extracted from continued fraction convergents, we deduce an improved upper bound for the secret key: . In this context, and , where S serves as a known approximation of the prime sum . As an extension of our preliminary conference proceedings, this paper supplies comprehensive proofs for all theoretical propositions, performs a comprehensive parameter sensitivity evaluation, and provides bounds for partial prime exposure scenarios. Empirical evaluations confirm the theoretical mechanics of our framework, demonstrating that it offers improved bounds in specific partial leakage scenarios compared to traditional lattice-only baselines.- 18 June 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (3) , 40
Open AccessA Hybrid Attack on Small Private Exponent RSA via Continued Fractions and Lattices
In this study, we propose a hybrid cryptanalytic technique targeting the RSA cryptosystem when instantiated with small private exponents. By integrating the continued fraction approach with Coppersmith’s lattice-based technique, we formulate a novel vulnerability framework. Utilizing an innovative relationship extracted from continued fraction convergents, we deduce an improved upper bound for the secret key: . In this context, and , where S serves as a known approximation of the prime sum . As an extension of our preliminary conference proceedings, this paper supplies comprehensive proofs for all theoretical propositions, performs a comprehensive parameter sensitivity evaluation, and provides bounds for partial prime exposure scenarios. Empirical evaluations confirm the theoretical mechanics of our framework, demonstrating that it offers improved bounds in specific partial leakage scenarios compared to traditional lattice-only baselines. - 20 February 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1070
A more complete cryptanalysis of the RSA-polynomial problem
- 20 February 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1070
A more complete cryptanalysis of the RSA-polynomial problem
- 7 July 2025
- Published by Springer Nature
- p. 438-446
Improving RSA Cryptanalysis: Combining Continued Fractions and Coppersmith’s Techniques
- 7 July 2025
- Published by Springer Nature
- p. 438-446
Improving RSA Cryptanalysis: Combining Continued Fractions and Coppersmith’s Techniques
- 2 July 2025
- Published by Springer Nature
- p. 91-112
A Novel Partial Key Exposure Attack on Common Prime RSA
- 2 July 2025
- Published by Springer Nature
- p. 91-112
A Novel Partial Key Exposure Attack on Common Prime RSA
- Open Access
- 4 March 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (2) , 23-68
MulLeak: Exploiting Multiply Instruction Leakage to Attack the Stack-optimized Kyber Implementation on Cortex-M4
CRYSTALS-Kyber, one of the NIST PQC standardization schemes, has garnered considerable attention from researchers in recent years for its side-channel security. Various targets have been explored in previous studies; however, research on extracting secret information from stack-optimized implementations targeting the Cortex-M4 remains scarce, primarily due to the lack of memory access operations, which increases the difficulty of attacks.This paper shifts the focus to the leakage of multiply instructions and present a novel cycle-level regression-based leakage model for the following attacks. We target the polynomial multiplications in decryption process of the stack-optimized implementation targeting the Cortex-M4, and propose two regression-based profiled attacks leveraging known ciphertext and chosen ciphertext methodologies to recover the secret coefficients individually. The later one can also be extended to the protected implementation.Our practical evaluation, conducted on the stack-optimized Kyber-768 implementation from the pqm4 repository, demonstrates the effectiveness of the proposed attacks. Focusing on the leakage from the pair-pointwise multiplication, specifically the macro doublebasemul_frombytes_asm, we successfully recover all secret coefficients with a success rate exceeding 95% using a modest number of traces for each attack. This research underscores the potential vulnerabilities in PQC implementations against side-channel attacks and contributes to the ongoing discourse on the physical security of cryptographic algorithms.
- 4 March 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (2) , 23-68
Open AccessMulLeak: Exploiting Multiply Instruction Leakage to Attack the Stack-optimized Kyber Implementation on Cortex-M4
CRYSTALS-Kyber, one of the NIST PQC standardization schemes, has garnered considerable attention from researchers in recent years for its side-channel security. Various targets have been explored in previous studies; however, research on extracting secret information from stack-optimized implementations targeting the Cortex-M4 remains scarce, primarily due to the lack of memory access operations, which increases the difficulty of attacks.This paper shifts the focus to the leakage of multiply instructions and present a novel cycle-level regression-based leakage model for the following attacks. We target the polynomial multiplications in decryption process of the stack-optimized implementation targeting the Cortex-M4, and propose two regression-based profiled attacks leveraging known ciphertext and chosen ciphertext methodologies to recover the secret coefficients individually. The later one can also be extended to the protected implementation.Our practical evaluation, conducted on the stack-optimized Kyber-768 implementation from the pqm4 repository, demonstrates the effectiveness of the proposed attacks. Focusing on the leakage from the pair-pointwise multiplication, specifically the macro doublebasemul_frombytes_asm, we successfully recover all secret coefficients with a success rate exceeding 95% using a modest number of traces for each attack. This research underscores the potential vulnerabilities in PQC implementations against side-channel attacks and contributes to the ongoing discourse on the physical security of cryptographic algorithms.
- Open Access
- 12 December 2024
- Published by Springer Nature in Cybersecurity
- Vol. 7 (1) , 1-19
Lattice-based cryptanalysis of RSA-type cryptosystems: a bibliometric analysis
The RSA (Rivest–Shamir–Adleman) cryptosystem is a widely used public-key cryptographic algorithm in information systems and computer applications. With the advancement of lattice theory, a technique known as the lattice-based method has emerged as a significant threat to RSA and its variants. This paper aims to conduct a bibliometric analysis of publications in the field of lattice-based attacks on RSA-type cryptosystems. The analysis is based on a dataset of relevant publications retrieved from Scopus and utilizes visualization tools such as CiteSpace and VOSviewer for a thorough overview. In order to understand the research developmental trajectory, we analyze the publication trends over the years, explore cooperation networks at various levels, including country/region, institution, and author, and assess the extent of collaboration, contribution, and productivity within the field. Additionally, author co-citation network and reference co-citation clustering are utilized to enable the identification of significant research achievements, cutting-edge developments, and structural framework. Furthermore, we conduct detailed analysis from a keyword perspective to identify research hotspots and emerging trends. The findings contribute to the existing body of knowledge on lattice-based cryptanalysis of RSA-type cryptosystems. Moreover, this bibliometric analysis serves as a valuable resource for identifying fruitful areas for further exploration and guides future research efforts.
- 12 December 2024
- Published by Springer Nature in Cybersecurity
- Vol. 7 (1) , 1-19
Open AccessLattice-based cryptanalysis of RSA-type cryptosystems: a bibliometric analysis
The RSA (Rivest–Shamir–Adleman) cryptosystem is a widely used public-key cryptographic algorithm in information systems and computer applications. With the advancement of lattice theory, a technique known as the lattice-based method has emerged as a significant threat to RSA and its variants. This paper aims to conduct a bibliometric analysis of publications in the field of lattice-based attacks on RSA-type cryptosystems. The analysis is based on a dataset of relevant publications retrieved from Scopus and utilizes visualization tools such as CiteSpace and VOSviewer for a thorough overview. In order to understand the research developmental trajectory, we analyze the publication trends over the years, explore cooperation networks at various levels, including country/region, institution, and author, and assess the extent of collaboration, contribution, and productivity within the field. Additionally, author co-citation network and reference co-citation clustering are utilized to enable the identification of significant research achievements, cutting-edge developments, and structural framework. Furthermore, we conduct detailed analysis from a keyword perspective to identify research hotspots and emerging trends. The findings contribute to the existing body of knowledge on lattice-based cryptanalysis of RSA-type cryptosystems. Moreover, this bibliometric analysis serves as a valuable resource for identifying fruitful areas for further exploration and guides future research efforts.