Quantum computer safe cryptography

Here we discuss the cryptosystems which are expected to play an important role in future. These are considered secure against quantum computers. That is, the kind of computers built using quantum physics theories.

To get started, one can consider the following resources:

S. No.Books/lecture notes/video lectures
1Quantum Computing and Cryptography by Kelsey Houston-Edwards (PBS, 2017)
2Graduate Summer School on Post-quantum and Quantum Cryptography - IPAM (2022) (YouTube)
3Summer School in Post-Quantum Cryptography - ELTE (2022)
4Mathematics of Modern Cryptography - IAS (2018) (YouTube)
5Introduction to mathematical cryptography - Christelle Vincent (PCMI, 2022)
6Post-quantum cryptography - Tanja Lange (TU/e, 2021)
7Quantum Algorithms and Complexity - Jean-Francois Biasse (USF, 2021)
8Mathematics of Public Key Cryptography - Steven D. Galbraith (CUP, Oct 2018)
9Workshop on Quantum Cryptanalysis of Post-Quantum Cryptography - Simons Institute (2020)
10ANTS Graduate Summer School - ANTS 2020

Isogeny based cryptography

Published:

Isogeny-based cryptography is a kind of elliptic-curve cryptography, whose security relies on (various incarnations of) the problem of finding an explicit isogeny between two given isogenous supersingular elliptic curves over a finite field $\mathbb F_q$. However, given an elliptic curve $E$ in Weierstrass form over a finite field $\mathbb F_q$ and a point $P$ on $E$ of order $n$, one can compute a cyclic separable isogeny of degree $n$ using Velu’s formulas in SageMath (implemented by D. Shumow in 2009).