Qi Cheng

RESEARCH INTERESTS

Cryptography, DNA/molecular computing, algorithmic self-assembly and theoretical computer science.

BIOGRAPHY

Dr. Qi Cheng received the BS, degree from Nankai University in computer science in 1992, the MS, degree in computer science from Fudan University in 1995, and the PhD,. degree in computer science from the University of Southern California in 2001. He taught at Fudan University for one year (1995-1996). He joined the University of Oklahoma in 2001 as an assistant professor in the School of Computer Science. His research interests include cryptography, DNA/molecular computing and theoretical computer science. He has been publishing in journals and conference proceedings such as Computational Geometry, Algorithmic Number Theory Symposium (ANTS), ACMS symposium on the Theory of Computing (STOC) and RSA conference cryptographer track. He is a member of the Association of Computing Machinery.

SELECTED PUBLICATIONS

Qi Cheng, Primality Proving via One Round in ECPP and One Iteration in AKS , Crypto 2003, Santa Barbara, LNCS 2729.

Qi Cheng, On the Ultimate Complexity of Factorials, The 20th International Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 2607, Berlin, Germany, 2003.

Qi Cheng, Some Remarks on the L-conjecture, The 13th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS 2518, Vancouver, Canada, 2002.

Len Adleman, Qi Cheng, Ashish Goel, Ming-Deh Huang, David Kempe, Pablo Moisset de Espanes and Paul Rothemund, Combinatorial optimization problems in self-assembly, 34th Annual ACMS,posium on the Theory of Computing(STOC), 2002.

Qi Cheng and Shigenori Uchiyama, Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture, RSA conference cryptographers' track, 2002, LNCS 2271, Springer.