Two topics in hyperelliptic cryptography

F Hess, G Seroussi, NP Smart

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

6 Citations (Scopus)

Abstract

In this paper we address two important topics in hyperelliptic cryptography. The first is how to construct in a verifiably random manner hyperelliptic curves for use in cryptography in generas two and three. The second topic is how to perform divisor compression in the hyperelliptic case. Hence, in both cases we generalise concepts used in the more familiar elliptic curve case to the hyperelliptic context.
Translated title of the contributionTwo topics in hyperelliptic cryptography
Original languageEnglish
Title of host publication Selected Areas in Cryptography - SAC 2001
EditorsS. Vaudenay, A. M. Youssef
PublisherSpringer Berlin Heidelberg
Pages181 - 189
Number of pages8
Volume2259
ISBN (Print)3540430660
Publication statusPublished - Dec 2001

Bibliographical note

Conference Proceedings/Title of Journal: Selected Areas in Cryptography

Fingerprint Dive into the research topics of 'Two topics in hyperelliptic cryptography'. Together they form a unique fingerprint.

  • Cite this

    Hess, F., Seroussi, G., & Smart, NP. (2001). Two topics in hyperelliptic cryptography. In S. Vaudenay, & A. M. Youssef (Eds.), Selected Areas in Cryptography - SAC 2001 (Vol. 2259, pp. 181 - 189). Springer Berlin Heidelberg. http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=1000597