<< Go Back


  • PingWang, Lecture
  • 2013-now: Lecturer, Shenzhen University, China
  • 2012: PhD, Sun Yat-sen University, China
  • E-Mail:

 Research Interesting:  Elliptic Curve Cryptography (ECC), quantum computation, quantum cryptography, Big Data Security



[1] Ping Wang and Fangguo Zhang, “Computing Elliptic Curve Discrete Logarithms with the Negation Map”, Information Sciences, Volume 195, pp. 277-286, 2012. (SCI, JCR 1Q)
[2] Ping Wang and Fangguo Zhang, “Improved Pollard Rho Method for Computing Discrete Logarithms over Finite Extension Fields”, Journal of Computational and Applied Mathematics, Volume 236 Issue 17, pp. 4336-4343, 2012. (SCI)
[3] Ping Wang and Fangguo Zhang, “An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard's Rho”, Journal of Applied Mathematics, Volume 2012, Article ID 635909, 2012. (SCI)
[4] Fangguo Zhang and Ping Wang, “Speeding Up Elliptic Curve Discrete Logarithm Computations with Point Halving”, Designs, Codes and Cryptography, 67(2), pp. 197-208, 2013. (SCI)
[5] Ping Wang and Fangguo Zhang, “Improving the Parallelized Pollard Rho Method for Computing Elliptic Curve Discrete Logarithms”, The 4-th International Conference on Emerging Intelligent Data and Web Technologies (EIDWT-2013), pp. 285-291, 2013.
[6] Fangguo Zhang and Ping Wang, “On Relationship of Computational Diffie- Hellman Problem and Computational Square-Root Exponent Problem”, International Workshop on Coding and Cryptology 2011, LNCS 6639, pp. 283-293, 2011.

last updated:2014/10/27
Research Institute of Network and Information Security,Shenzhen University | since 2014