Yongge Wang (born 1967) is a computer science professor at the

University of North Carolina at Charlotte The University of North Carolina at Charlotte (UNC Charlotte or simply Charlotte) is a public research university in Charlotte, North Carolina. UNC Charlotte offers 24 doctoral, 66 master's, and 79 bachelor's degree programs through nine colle ...

specialized in algorithmic complexity and

cryptography Cryptography, or cryptology (from grc, , translit=kryptós "hidden, secret"; and ''graphein'', "to write", or ''-logia'', "study", respectively), is the practice and study of techniques for secure communication in the presence of adve ...

. He is the inventor of

IEEE P1363 IEEE P1363 is an Institute of Electrical and Electronics Engineers (IEEE) standardization project for public-key cryptography. It includes specifications for: * Traditional public-key cryptography (IEEE Std 1363-2000 and 1363a-2004) * Lattice-ba ...

cryptographic standards SRP5 and WANG-KE and has contributed to the mathematical theory of

algorithmic randomness Intuitively, an algorithmically random sequence (or random sequence) is a sequence of binary digits that appears random to any algorithm running on a (prefix-free or not) universal Turing machine. The notion can be applied analogously to sequenc ...

. He co-authored a paper demonstrating that a

recursively enumerable In computability theory, a set ''S'' of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if: *There is an algorithm such that the ...

real number In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every r ...

is an

algorithmically random sequence Intuitively, an algorithmically random sequence (or random sequence) is a sequence of binary digits that appears random to any algorithm running on a (prefix-free or not) universal Turing machine. The notion can be applied analogously to sequenc ...

if and only if it is a

Chaitin's constant In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number) or halting probability is a real number that, informally speaking, represents the probability that a randomly constructed program will ...

for some encoding of programs. He also showed the separation of Schnorr randomness from recursive randomness. He also invented a distance based statistical testing technique to improve NIST SP800-22 testing in

randomness tests A randomness test (or test for randomness), in data evaluation, is a test used to analyze the distribution of a set of data to see if it can be described as random (patternless). In stochastic modeling, as in some computer simulations, the hoped- ...

. In cryptographic research, he is known for the invention of the quantum resistant random linear code based encryption scheme RLCE.

References

External links

Yongge Wang's homepage

Quantum Resistant RLCE Encryption Scheme homepage
Modern cryptographers Chinese cryptographers Living people 1967 births {{academic-bio-stub