Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Authors

Colleges, School and Institutes

External organisations

  • University of Auckland
  • Universitat Pompeu Fabra, Barcelona

Abstract

We provide a new identification protocol and new signature schemes based on isogeny problems. Our identification protocol relies on the hardness of the endomorphism ring computation problem, arguably the hardest of all problems in this area, whereas the only previous scheme based on isogenies (due to De Feo, Jao and Plut) relied on potentially easier problems. The protocol makesnovel use of an algorithm of Kohel-Lauter-Petit-Tignol for the quaternion version of the l -isogeny problem, for which we provide a more complete description and analysis. Our new signature schemes are derived from the identification protocols using the Fiat-Shamir (respectively, Unruh) transforms for classical (respectively, post-quantum) security. We study their efficiency, highlighting very small key sizes and reasonably efficient signing and verification algorithms.

Bibliographic note

Winner of the Best Paper Award of ASIACRYPT 2017 conference.

Details

Original languageEnglish
Title of host publicationASIACRYPT 2017
Subtitle of host publicationProceedings of the 23rd International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT 2017)
Publication statusPublished - 7 Dec 2017
Event23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT 2017) - Hong Kong
Duration: 3 Dec 20177 Dec 2017

Conference

Conference23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT 2017)
CityHong Kong
Period3/12/177/12/17