Skip to the content.
Invited Talks
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
International Conference Talks
- A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More
- Quantum Complexity for Discrete Logarithms and Related Problems
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
- Quantum Random Oracle Model with Auxiliary Input
- Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation
- Cryptanalysis of Branching Program Obfuscators
Not-refereed Talks
- How to prove a statement is hard to prove in TCS? (or, how not to construct pseudorandom unitaries from pseudorandom states)
Mar. 2025, KIAS, Seoul, Korea
- Limits on the Provable Consequences of Pseudorandom Quantum States
Nov. 2024, UT Austin, Texas, USA
- Does quantum lattice sieving require quantum RAM?
- Quantum Complexity for Discrete Logarithms and Integer Factorization
Sep. 2024, IMI Workshop, Fukuoka, Japan
- Cryptography in Quantum World
Jul. 2024, Sungshin Women’s University, Seoul, Korea (Hosted by Joohee Lee)
- How secure is lattice-based cryptography against quantum attacks?
Jul. 2024, NSHC, Seoul, Korea
- From quantum physics to cryptography and back
- Quantum Complexity for Discrete Logarithms and Integer Factorization
- Quantum Complexity for Discrete Logarithms and Integer Factorization
Mar. 2024, The University of Texas at Austin, Online (Hosted by Scott Aaronson)
- From the Hardness of Detecting Superpositions to Cryptography
- Few Non-Clifford Gates and Symplectic Fourier Analysis
Dec. 2023, KIAS, Seoul
- Classical and Quantum Algorithms for Lattice Problems
Nov. 2023, Seoul National University, Department of Computer Science and Engineering, Seoul (Hosted by Taehyun Kim)
- Quantum Learning and Cryptographic Assumptions
Nov. 2023, KIAS, Seoul
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Oct. 2023, The University of Tokyo, Department of Basic Science, Tokyo (Hosted by Ryuji Takagi)
- Quantum Complexity for Discrete Logarithms and Beyond
Sep. 2023, KIAS, Seoul
- Shor’s Algorithm: Optimal or Not
Aug. 2023, Qcrypt 2023, Rump Session, Most Concise Technical Talk Award
- Quantum Complexity for Discrete Logarithms and Related Problems
Aug. 2023, Kyoto University, Yukawa Institute for Theoretical Physics, Kyoto (Hosted by Tomoyuki Morimae)
- Public key encryptions in Post-quantum Era
Jul. 2023, Seoul National University, Department of Computer Science and Engineering, Seoul (Hosted by Yongsoo Song)
- Computer Science meets Physics
Jul. 2023, Seoul National University, Department of Physics & Astronomy, Seoul (Hosted by Hyunseok Jeong)
- Quantum Complexity for Discrete Logarithms and Related Problems
- Quantum Complexity for Discrete Logarithms and Related Problems
Jul. 2023, Electronics and Telecommunications Research Institute, Daejeon (Hosted by Taewan Kim)
- Review on the Quantum Dynamic Programming Algorithms
Jun. 2023, KIAS, Seoul
- Quantum Computers and Algorithms, Computer Scientists’ Perspective
May. 2023, Korea University, Quantum Workforce Center, Seoul (Hosted by Mahn-soo Choi)
- From the Hardness of Detecting Superpositions to Cryptography, and a little bit more
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Mar. 2023, National Security Research Institute, Daejeon (Hosted by Minkyu Kim)
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Jan. 2023, SNU, QST Seminar, Online (Hosted by Kabgyun Jeong)
- Compressed Quantum Random Oracles and Applications
Jan. 2023, KAIST, School of Computing, Daejeon (Hosted by Jooyoung Lee)
- Introduction to Quantum Computing and Quantum Cryptanalysis
Dec. 2022, KAIST, School of Computing, Daejeon (Hosted by Jooyoung Lee)
- From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Nov. 2022, KIAS, Seoul
- Quantum Computations vs. Post-quantum Cryptography (2022)
Nov. 2022, Desilo, Seoul
- Cryptographic Models vs. Quantum Algorithms: Oracle models and QRAM
Nov. 2022, KIAS, Seoul
- On locality-sensitive hashing and more
Oct. 2022, Hanyang University, Department of Mathematics, Seoul (Hosted by Jae Hong Seo)
- Complexity theory meets mathematics
- On influence of block-multilinear polynomials
Jul. 2022, SNU, Seoul
- Cryptographic Algorithms for Quantum Computations
Jun. 2022, Thesis defense, SNU, Seoul
- Quantum attacks on symmetric key crypto beyond Grover’s algorithm
Oct. 2021, SNU, QST Seminar, Online
- Claw-free trapdoor functions and its applications in classical-quantum communications
- Introduction to security proofs in QROM
Feb. 2020, KAIST, Daejeon (Hosted by Kwangjo Kim)
- Quantum Random Oracle Model with Auxiliary Input
- Cryptanalysis of Branching Program Obfuscators