Journal ArticleOPEN ACCESS

Constructing hyperelliptic curves of genus 2 suitable for cryptography

  • Weng A
Mathematics of Computation (2002) 72(241) 435-458
DOI: 10.1090/s0025-5718-02-01422-9
0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

In this article we show how to generalize the CM-method for elliptic curves to genus two. We describe the algorithm in detail and discuss the results of our implementation.

Cite

CITATION STYLE

APA

Weng, A. (2002). Constructing hyperelliptic curves of genus 2 suitable for cryptography. Mathematics of Computation, 72(241), 435–458. https://doi.org/10.1090/s0025-5718-02-01422-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free