Abstracts for Conference on "The Mathematics of Post-Quantum Cryptography"

When studying proposed isogeny-based cryptosystems, several computational problems naturally appear: some are upper bounds for the security of the system (if one can solve the problem, then one can break the cryptosystem), some are lower bounds (if one can break the cryptosystem, then one can solve the problem). We would therefore like to understand the relative difficulty of these problems, ideally showing that they are all equivalent.