講演題目： Computational hardness assumptions for oriented curves in isogeny-based cryptography
概要： Isogeny-based cryptography is a proposal for post-quantum cryptography that bases its security on computational problems related to maps between elliptic curves. Some protocols, most notably CSIDH and CRS, are based on group actions by class groups of imaginary quadratic orders on oriented elliptic curves. We discuss some computational hardness assumptions that arise from such schemes, and analyze how they may be attacked using the theory of pairings.