Postquantum Opportunities: Lattices, Homomorphic Encryption, and Supersingular Isogeny Graphs
Kristin Lauter · IEEE Security & Privacy · 2017
Supersingular isogeny graph-based cryptography has not yet been standardized, but the underlying hard problem has now been proposed as the basis for many cryptographic protocols. This motivates further investigation into the hardness of the underlying problem and the security of the proposed protocols.