Jingguo Bi
Associate Member
Department of Cryptology
Institute for Advanced Study, Tsinghua University
China
Biography
"Education background 2007.09ï¼2012.12， School of Mathematics, Shangdong University. Ph.D. 2011.09ï¼2012.09， Department of Computer Science, The university of Oklahoma. Visting scholar. 2003.09ï¼2007.07， School of Mathematics, Shangdong University. Bachelor. Experience 2015.6ï¼ Associate member, Institute for Advanced Study, Tsinghua university 2013.3ï¼2015.6, Post doctor, Institute for Advanced Study, Tsinghua university"
Research Interest
research interest focuses mainly on the design and security assessment of the cryptosystems, especially on the design and cryptanalysis of the public-key schemes and solving the cryptologic mathematical problems by using lattice-based method. Related research results have been published in the famous cryptology conferences, such as PKCã€ISSACã€ISIT.
Publications
-
Jingguo Bi, Qi Cheng, J. Maurice Rojas: Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. International Symposium on Symbolic and Algebraic Computation 2013 (ISSAC 2013): 61-68. (The winner of Distinguished Paper Award).
-
Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun: Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. Public Key Cryptography 2014 (PKC 2014): 185-202
-
Jingguo Bi and Qi Cheng. Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices. Theoritical Computer Science 560, 121-130, 2014.(Journal version of the article in TAMC 2012)
