The security of public key cryptography is based on the hardness of certain algorithmic problems. Schemes we use today rely on the hardness of factoring and computing discrete logarithms in elliptic curve groups. Unfortunately, these are no longer secure once a large-scale quantum computer is built. Thus we have to switch (not instantly but gradually) our currently used protocols (e.g., TLS) to ensure quantum resistance. In this talk I will describe how the abelian hidden subgroup problem relates to factoring and discrete logarithms and will present hard algorithmic problems that we presume are intractable even for a quantum computer.
2022. 05. 24. 14:15
Péter Kutas (ELTE)