Paper 2016/1154
Signature Schemes Based On Supersingular Isogeny Problems
Steven D. Galbraith and Christophe Petit and Javier Silva
Abstract
We present the first 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, uses novel ideas that have not been used in cryptography previously, 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.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- isogeny problemspost-quantum
- Contact author(s)
- s galbraith @ auckland ac nz; christophe petit @ maths ox ac uk; javier silva @ upf edu
- History
- 2018-03-13: last of 5 revisions
- 2016-12-21: received
- See all versions
- Short URL
- https://ia.cr/2016/1154
- License
-
CC BY