A tutorial on post-quantum cryptography

NExT Forum:Quantum communication technology and applications

【講者】 Chen-Mou Cheng, Chief Cryptographer, BTQ

【講題】A tutorial on post-quantum cryptography
【摘要】 Public-key cryptography (PKC) is a cornerstone of our society’s information-security infrastructure, without which it is extremely difficult to establish trust and do business on the internet, just to give a few examples of its indispensable applications in our daily life. The security of a PKC is typically determined using the best algorithms for solving a few underlying mathematical problems plus certain extrapolation heuristics. For today’s most widely deployed PKCs like RSA and elliptic curve cryptography, their security depends on the hardness of factoring large integers or solving discrete logarithm problems on some elliptic curve groups. Unfortunately, these (classically) hard mathematical problems can be solved in much more efficiently using Shor’s algorithm, rendering them insecure when large quantum computers are built. To mitigate to this existential threat, the cryptological research community has looked into post-quantum cryptography (PQC). These are PKCs whose security is based on alternative mathematical problems that seems hard to solve even on a large quantum computer, such as finding short vectors in a high-dimensional euclidean lattice or solving nonlinear polynomial equations over a finite field. In this tutorial, we will give an overview of PQC and discuss some of its most recent developments and standardization efforts, as well as outline some of the challenges and potential solutions when migrating to a cyberspace secured by PQC.

Organizer:鴻海研究院HHRI、台大量子科學及工程研究中心Center for Quantum Science and Engineering
Co-Organizer:財團法人人工智慧科技基金會AIF 、國家理論科學研究中心物理組NCTS Physics

Scroll to Top