1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.IT2008★ 1 cited
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Qi Cheng, Daqing Wan
The complexity of maximal likelihood decoding of the Reed-Solomon codes is a well known open problem. The only known result in this direction states that it is at leas…
math.NT2003
On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions
Qi Cheng
In this paper, we study the discrete logarithm problem in the finite fields $\F_{q^n}$ where . The field is called a Kummer field or a Kummer extension of $\F_q$. It plays a…
math.NT2003
Primality Proving via One Round in ECPP and One Iteration in AKS
Qi Cheng
In this paper, a random primality proving algorithm is proposed, which generates prime certificate of length O(log n). The certificate can be verified in deterministic time O(log^4…