Yongge Wang (born 1967) is a computer science professor at the University of North Carolina at Charlotte specialized in algorithmic complexity and cryptography. He is the inventor of IEEE P1363 cryptographic standards SRP5 and WANG-KE[1][2] and has contributed to the mathematical theory of algorithmic randomness. He co-authored a paper demonstrating that a recursively enumerable real number is an algorithmically random sequence if and only if it is a Chaitin's constant for some encoding of programs. He also showed the separation[3] of Schnorr randomness from recursive randomness. He also invented a distance based statistical testing technique to improve NIST SP800-22 testing in randomness tests. In cryptographic research, he is known for the invention of the quantum resistant random linear code based encryption scheme RLCE.[4][5]
References
edit- ^ "IEEE P1363.2 Draft Download". IEEE. Archived from the original on May 5, 2002. Retrieved 22 August 2017.
- ^ "Identity-Based Public-Key Cryptography". IEEE. Archived from the original on May 2, 2006. Retrieved 22 August 2017.
- ^ "Inaugural Dissertation zur Erlangung der Doktorw¨urde der Naturwissenschaftlich-Mathematischen Gesamtfakult¨at der Ruprecht-Karls-Universit¨at Heidelberg vorgelegt von Yongge Wang aus Gansu, China 1996 Randomness and Complexity Gutachter: Prof. Dr. Klaus Ambos-Spies Prof. Dr. Jack Lutz Tag der m¨undlichen Pr¨ufung: August 30, 1996" (PDF). Webpages.uncc.edu. Retrieved 2017-08-22.
- ^ Wang, Yongge (28 December 2015). "Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE". arXiv:1512.08454 [cs.CR].
- ^ "Quantum Resistant RLCE Encryption Scheme". Retrieved 2017-10-02.
External links
edit
 | This biography of an academic is a stub. You can help Wikipedia by expanding it. |