CryptoDB
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
| Authors: | |
|---|---|
| Download: | |
| Abstract: | We present signature schemes whose security relies on computational assumptions relating to isogeny graphs of supersingular elliptic curves. We give two schemes, both of them based on interactive identification protocols. The first identification protocol is due to De Feo, Jao and Plût. The second one, and the main contribution of the paper, makes novel use of an algorithm of Kohel, Lauter, Petit and Tignol for the quaternion version of the $$\ell $$ ℓ -isogeny problem, for which we provide a more complete description and analysis, and is based on a more standard and potentially stronger computational problem. Both identification protocols lead to signatures that are existentially unforgeable under chosen message attacks in the random oracle model using the well-known Fiat-Shamir transform, and in the quantum random oracle model using another transform due to Unruh. A version of the first signature scheme was independently published by Yoo, Azarderakhsh, Jalali, Jao and Soukharev. This is the full version of a paper published at ASIACRYPT 2017. |
BibTeX
@article{jofc-2020-30108,
title={Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems},
journal={Journal of Cryptology},
publisher={Springer},
volume={33},
pages={130-175},
doi={10.1007/s00145-019-09316-0},
author={Steven D. Galbraith and Christophe Petit and Javier Silva},
year=2020
}