Qi Cheng

76 papers A* 10A 1B 7C 2Misc 2Journal 50Unranked 4
YearRankTypeTitle / Venue / Authors
2022 J jnl
Computing zeta functions of large polynomial systems over finite fields.
J. Complex.
Qi Cheng, J. Maurice Rojas, Daqing Wan
2022 J jnl
LWE from non-commutative group rings.
Des. Codes Cryptogr.
Qi Cheng, Jun Zhang, Jincheng Zhuang
2021 — conf
On the Ideal Shortest Vector Problem over Random Rational Primes.
EUROCRYPT (1)
Yanbin Pan, Jun Xu, Nick Wadleigh, Qi Cheng
2021 J jnl
On the Ideal Shortest Vector Problem over Random Rational Primes.
IACR Cryptol. ePrint Arch.
Yanbin Pan, Jun Xu, Nick Wadleigh, Qi Cheng
2020 J jnl
Computing zeta functions of large polynomial systems over finite fields.
CoRR
Qi Cheng, J. Maurice Rojas, Daqing Wan
2020 J jnl
On the ideal shortest vector problem over random rational primes.
CoRR
Yanbin Pan, Jun Xu, Nick Wadleigh, Qi Cheng
2019 J jnl
A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions.
Sci. China Inf. Sci.
Dianyan Xiao, Qi Cheng
2018 J jnl
Factor base discrete logarithms in Kummer extensions.
Finite Fields Their Appl.
Dianyan Xiao, Jincheng Zhuang, Qi Cheng
2017 J jnl
Counting Roots of Polynomials Over Prime Power Rings.
CoRR
Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan
2017 J jnl
Sparse univariate polynomials with many roots over finite fields.
Finite Fields Their Appl.
Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan
2016 J jnl
LWE from Non-commutative Group Rings.
CoRR
Qi Cheng, Jincheng Zhuang
2016 J jnl
LWE from Non-commutative Group Rings.
IACR Cryptol. ePrint Arch.
Qi Cheng, Jincheng Zhuang
2016 J jnl
On Determining Deep Holes of Generalized Reed-Solomon Codes.
IEEE Trans. Inf. Theory
Jincheng Zhuang, Qi Cheng, Jiyou Li
2016 J jnl
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields.
SIAM J. Comput.
Jingguo Bi, Qi Cheng, J. Maurice Rojas
2015 J jnl
Factor Base Discrete Logarithms in Kummer Extensions.
IACR Cryptol. ePrint Arch.
Dianyan Xiao, Jincheng Zhuang, Qi Cheng
2015 Misc conf
On Generating Coset Representatives of PGL
Inscrypt
Jincheng Zhuang, Qi Cheng
2015 J jnl
On Generating Coset Representatives of PGL
IACR Cryptol. ePrint Arch.
Jincheng Zhuang, Qi Cheng
2014 J jnl
Lower bounds of shortest vector lengths in random NTRU lattices.
Theor. Comput. Sci.
Jingguo Bi, Qi Cheng
2014 J jnl
Sparse Univariate Polynomials with Many Roots Over Finite Fields.
CoRR
Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan
2014 J jnl
Traps to the BGJT-algorithm for discrete logarithms.
LMS J. Comput. Math.
Qi Cheng, Daqing Wan, Jincheng Zhuang
2013 B conf
On Determining Deep Holes of Generalized Reed-Solomon Codes.
ISAAC
Qi Cheng, Jiyou Li, Jincheng Zhuang
2013 J jnl
On Determining Deep Holes of Generalized Reed-Solomon Codes.
CoRR
Qi Cheng, Jiyou Li, Jincheng Zhuang
2013 J jnl
On certain computations of Pisot numbers.
Inf. Process. Lett.
Qi Cheng, Jincheng Zhuang
2013 B conf
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields.
ISSAC
Jingguo Bi, Qi Cheng, J. Maurice Rojas
2013 J jnl
Traps to the BGJT-Algorithm for Discrete Logarithms.
CoRR
Qi Cheng, Daqing Wan, Jincheng Zhuang
2013 J jnl
Traps to the BGJT-Algorithm for Discrete Logarithms.
IACR Cryptol. ePrint Arch.
Qi Cheng, Daqing Wan, Jincheng Zhuang
2012 J jnl
A Deterministic Reduction for the Gap Minimum Distance Problem.
IEEE Trans. Inf. Theory
Qi Cheng, Daqing Wan
2012 A* conf
Constructing high order elements through subspace polynomials.
SODA
Qi Cheng, Shuhong Gao, Daqing Wan
2012 C conf
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices.
TAMC
Jingguo Bi, Qi Cheng
2012 J jnl
Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields.
CoRR
Jingguo Bi, Qi Cheng, J. Maurice Rojas
2011 J jnl
Counting Value Sets: Algorithm and Complexity
CoRR
Qi Cheng, Joshua E. Hill, Daqing Wan
2011 J jnl
Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices.
IACR Cryptol. ePrint Arch.
Jingguo Bi, Qi Cheng
2011 J jnl
On the minimum gap between sums of square roots of small integers.
Theor. Comput. Sci.
Qi Cheng, Yu-Hsin Li
2010 J jnl
Bounding the sum of square roots via lattice reduction.
Math. Comput.
Qi Cheng, Xianmeng Meng, Celi Sun, Jiazhe Chen
2010 J jnl
Complexity of decoding positive-rate primitive Reed-Solomon codes.
IEEE Trans. Inf. Theory
Qi Cheng, Daqing Wan
2010 J jnl
Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing.
Theory Comput. Syst.
Qi Cheng, Sergey P. Tarasov, Mikhail N. Vyalyi
2010 B conf
Finding the Smallest Gap between Sums of Square Roots.
LATIN
Qi Cheng, Yu-Hsin Li
2009 A* conf
A deterministic reduction for the gap minimum distance problem: [extended abstract].
STOC
Qi Cheng, Daqing Wan
2009 J jnl
Bounding the Sum of Square Roots via Lattice Reduction
CoRR
Qi Cheng, Xianmeng Meng, Celi Sun, Jiazhe Chen
2008 — conf
A Number Theoretic Memory Bounded Function and Its Applications.
ICYCS
Qi Cheng, Yu-Hsin Li
2008 J jnl
Complexity of Decoding Positive-Rate Reed-Solomon Codes
CoRR
Qi Cheng, Daqing Wan
2008 — conf
Complexity of Decoding Positive-Rate Reed-Solomon Codes.
ICALP (1)
Qi Cheng, Daqing Wan
2008 J jnl
Hard Problems of Algebraic Geometry Codes.
IEEE Trans. Inf. Theory
Qi Cheng
2007 J jnl
Constructing Finite Field Extensions with Large Order Elements.
SIAM J. Discret. Math.
Qi Cheng
2007 A* conf
Derandomization of Sparse Cyclotomic Integer Zero Testing.
FOCS
Qi Cheng
2007 C conf
On Deciding Deep Holes of Reed-Solomon Codes.
TAMC
Qi Cheng, Elizabeth Murray
2007 J jnl
On the List and Bounded Distance Decodability of Reed-Solomon Codes.
SIAM J. Comput.
Qi Cheng, Daqing Wan
2007 J jnl
Primality Proving via One Round in ECPP and One Iteration in AKS.
J. Cryptol.
Qi Cheng
2006 B conf
On Comparing Sums of Square Roots of Small Integers.
MFCS
Qi Cheng
2006 J jnl
On comparing sums of square roots of small integers
CoRR
Qi Cheng
2006 J jnl
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
Algorithmica
Qi Cheng, Ming-Deh A. Huang
2005 J jnl
Complexities for Generalized Models of Self-Assembly.
SIAM J. Comput.
Gagan Aggarwal, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao, Pablo Moisset de Espanés, Robert T. Schweller
2005 J jnl
Hard Problems of Algebraic Geometry Codes
CoRR
Qi Cheng
2005 J jnl
On Deciding Deep Holes of Reed-Solomon Codes
CoRR
Qi Cheng, Elizabeth Murray
2005 J jnl
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields.
SIAM J. Comput.
Qi Cheng
2005 J jnl
On the construction of finite field elements of large order.
Finite Fields Their Appl.
Qi Cheng
2004 A* conf
Constructing finite field extensions with large order elements.
SODA
Qi Cheng
2004 A* conf
Invadable self-assembly: combining robustness with efficiency.
SODA
Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés
2004 B conf
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.
ISAAC
Qi Cheng, Ming-Deh A. Huang
2004 J jnl
On counting and generating curves over small finite fields.
J. Complex.
Qi Cheng, Ming-Deh A. Huang
2004 A* conf
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields.
CRYPTO
Qi Cheng
2004 A* conf
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract).
FOCS
Qi Cheng, Daqing Wan
2004 J jnl
On the ultimate complexity of factorials.
Theor. Comput. Sci.
Qi Cheng
2003 A conf
On the Ultimate Complexity of Factorials.
STACS
Qi Cheng
2003 A* conf
Primality Proving via One Round in ECPP and One Iteration in AKS.
CRYPTO
Qi Cheng
2003 J jnl
Straight-line programs and torsion points on elliptic curves.
Comput. Complex.
Qi Cheng
2002 J jnl
A New Class of Unsafe Primes.
IACR Cryptol. ePrint Arch.
Qi Cheng
2002 A* conf
Combinatorial optimization problems in self-assembly.
STOC
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund
2002 J jnl
Kolmogorov random graphs only have trivial stable colorings.
Inf. Process. Lett.
Qi Cheng, Fang Fang
2002 B conf
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture.
CT-RSA
Qi Cheng, Shigenori Uchiyama
2002 B conf
Some Remarks on the L-Conjecture.
ISAAC
Qi Cheng
2001 A* conf
Running time and program size for self-assembled squares.
STOC
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
2000 J jnl
Computing simple paths among obstacles.
Comput. Geom.
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
2000 — conf
Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments.
ANTS
Qi Cheng, Ming-Deh A. Huang
1997 J jnl
MNP: A class of NP optimization problems.
J. Comput. Sci. Technol.
Qi Cheng, Hong Zhu
1995 Misc conf
MNP: A Class of NP Optimization Problems (Extended Abstract).
COCOON
Qi Cheng, Hong Zhu

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

In 2025, he co-authored Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja, published at CheckMATE. The paper evaluates the effectiveness of obfuscation techniques and their impact on source-level static analysis and binary-level decompilation.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.