Page 19 - My FlipBook
P. 19
Brochure 2020
extant multivariate cryptosystems. Bo-Yin’s team submitted The issue of the advantages that quantum adversaries have is
two proposals to NIST for their PQC competition. One of not limited to quantum computation, since those advantages
his proposals, Rainbow, is a Round 2 candidate and it will can also contribute to understanding how quantum
likely enter Round 3. He also studies the design, attack, and information is processed, to exploiting entanglements, and
realization of other PQC systems, principally lattice-based to making quantum superposition queries that naturally arise
cryptosystems. Over the years he has held rst place in various in various contexts such as leakage and tampering-resilient
lattice cryptanalysis challenges. His handiwork can be seen cryptography and constructions in the random oracle (RO)
in other post-quantum cryptosystems. One of his principal model. With regard to theoretical aspects, it is fundamental
contributions has been an algorithm for high-speed constant- to understand those adversarial advantages and how they
time computation of greatest common divisors and modular can enable enhanced security of practical post-quantum
multiplicative inverses, which is of paramount importance to cryptosystems. Our work on this topic focuses on developing
generating keys for NTRU and related cryptosystems. techniques to prove security against quantum adversaries in
the presence of quantum (side) information, as well as security
in the quantum RO model.
Quantum Cryptography
Unlike post-quantum cryptography that focuses on securing classical parties to securely exploit the quantum power of
classical crypto constructs against quantum adversaries, the untrusted quantum devices. His work on this topic resulted
general eld of quantum cryptography broadly explores what in construction of the only device-independent randomness
can be achieved when honest parties also have quantum amplification (DI-RA) protocol under proven minimal
technology. As a well-known example, quantum-key assumptions. Specifically, the DI-RA protocol his group has
distribution (QKD) enables communication with information- developed can certifiably generate truly random bits given
theoretic security, which is classically deemed impossible. As a weak source with sufficient minimum entropy without any
another example, when our data becomes quantum, will we structural assumptions. In contrast, other existing protocols
be able to encrypt quantum data and perform computation require structured Santha-Vazirani sources and certain
over it as we can for classical data? While practical research on conditional independence assumptions. Dr. Chung’s protocol
this question might be a long way o , quantum cryptography also implies a strong dichotomous theorem for intrinsic
is an exciting theoretical field that combines state-of-the-art randomness in fundamental physics, asserting either that
techniques from cryptography, quantum physics, complexity "Nature" is fully deterministic or that totally unpredictable
theory, and information theory. In turn, quantum cryptography events certi ably exist in "Nature".
also provides a rich context for developing deep insights and Dr. Chung and his group have also developed techniques
new techniques to advance the study of these contributory in quantum cryptography to study the power of classical-
quantum hybrid computation using low-depth quantum
elds. computation, answering conjectures by Scott Aaronson
Dr. Kai-Min Chung is a theorist who has worked on various and Richard Jozsa. Given that quantum computation will
theoretical aspects of (post-)quantum cryptography for be restricted to low depth, such hybrid models can capture
nearly a decade. He has served on the program committees the computational power available in the near term, but
of major international cryptography conferences such as the reliability of such hybrid models is unclear. In 2006,
CRYPTO, Eurocrypt, Asiacrypt, QCrypt, and TCC. Apart from Richard Jozsa postulated that any polynomial-time quantum
the theoretical topics on aforementioned PQC, he has also computation could be simulated in a hybrid model motivated
worked on several topics in quantum cryptography such by measurement-based quantum computation. In contrast,
as device-independent cryptography, secure multiparty Scott Aaronson inferred an oracle separation between BQP
quantum computation, and classical delegation of quantum and another type of hybrid model (first mentioned in 2005,
computation. He is also using techniques from quantum and resurrected in 2011 and 2014). Building on techniques
cryptography to investigate topics in quantum complexity from quantum cryptography, Dr. Chung’s team has revealed an
theory. oracle separation between BQP and both those hybrid models.
One of his research interests is device-independent These ndings support Aaronson’s conjecture and reject that
cryptography, through which protocols can be designed for of Jozsa.
17
extant multivariate cryptosystems. Bo-Yin’s team submitted The issue of the advantages that quantum adversaries have is
two proposals to NIST for their PQC competition. One of not limited to quantum computation, since those advantages
his proposals, Rainbow, is a Round 2 candidate and it will can also contribute to understanding how quantum
likely enter Round 3. He also studies the design, attack, and information is processed, to exploiting entanglements, and
realization of other PQC systems, principally lattice-based to making quantum superposition queries that naturally arise
cryptosystems. Over the years he has held rst place in various in various contexts such as leakage and tampering-resilient
lattice cryptanalysis challenges. His handiwork can be seen cryptography and constructions in the random oracle (RO)
in other post-quantum cryptosystems. One of his principal model. With regard to theoretical aspects, it is fundamental
contributions has been an algorithm for high-speed constant- to understand those adversarial advantages and how they
time computation of greatest common divisors and modular can enable enhanced security of practical post-quantum
multiplicative inverses, which is of paramount importance to cryptosystems. Our work on this topic focuses on developing
generating keys for NTRU and related cryptosystems. techniques to prove security against quantum adversaries in
the presence of quantum (side) information, as well as security
in the quantum RO model.
Quantum Cryptography
Unlike post-quantum cryptography that focuses on securing classical parties to securely exploit the quantum power of
classical crypto constructs against quantum adversaries, the untrusted quantum devices. His work on this topic resulted
general eld of quantum cryptography broadly explores what in construction of the only device-independent randomness
can be achieved when honest parties also have quantum amplification (DI-RA) protocol under proven minimal
technology. As a well-known example, quantum-key assumptions. Specifically, the DI-RA protocol his group has
distribution (QKD) enables communication with information- developed can certifiably generate truly random bits given
theoretic security, which is classically deemed impossible. As a weak source with sufficient minimum entropy without any
another example, when our data becomes quantum, will we structural assumptions. In contrast, other existing protocols
be able to encrypt quantum data and perform computation require structured Santha-Vazirani sources and certain
over it as we can for classical data? While practical research on conditional independence assumptions. Dr. Chung’s protocol
this question might be a long way o , quantum cryptography also implies a strong dichotomous theorem for intrinsic
is an exciting theoretical field that combines state-of-the-art randomness in fundamental physics, asserting either that
techniques from cryptography, quantum physics, complexity "Nature" is fully deterministic or that totally unpredictable
theory, and information theory. In turn, quantum cryptography events certi ably exist in "Nature".
also provides a rich context for developing deep insights and Dr. Chung and his group have also developed techniques
new techniques to advance the study of these contributory in quantum cryptography to study the power of classical-
quantum hybrid computation using low-depth quantum
elds. computation, answering conjectures by Scott Aaronson
Dr. Kai-Min Chung is a theorist who has worked on various and Richard Jozsa. Given that quantum computation will
theoretical aspects of (post-)quantum cryptography for be restricted to low depth, such hybrid models can capture
nearly a decade. He has served on the program committees the computational power available in the near term, but
of major international cryptography conferences such as the reliability of such hybrid models is unclear. In 2006,
CRYPTO, Eurocrypt, Asiacrypt, QCrypt, and TCC. Apart from Richard Jozsa postulated that any polynomial-time quantum
the theoretical topics on aforementioned PQC, he has also computation could be simulated in a hybrid model motivated
worked on several topics in quantum cryptography such by measurement-based quantum computation. In contrast,
as device-independent cryptography, secure multiparty Scott Aaronson inferred an oracle separation between BQP
quantum computation, and classical delegation of quantum and another type of hybrid model (first mentioned in 2005,
computation. He is also using techniques from quantum and resurrected in 2011 and 2014). Building on techniques
cryptography to investigate topics in quantum complexity from quantum cryptography, Dr. Chung’s team has revealed an
theory. oracle separation between BQP and both those hybrid models.
One of his research interests is device-independent These ndings support Aaronson’s conjecture and reject that
cryptography, through which protocols can be designed for of Jozsa.
17
