Skip to main content
Conference ProceedingsOPEN ACCESS

A family of jacobians suitable for discrete log cryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 403 LNCS 94-99
DOI: 10.1007/0-387-34799-2_8
40Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate the jacobians of the hyperelliptic curves v2 + v = u2g+1 over finite fields, and discuss which are likely to have '‘almost prime’' order.

Cite

CITATION STYLE

APA

Koblitz, N. (1990). A family of jacobians suitable for discrete log cryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 403 LNCS, pp. 94–99). Springer Verlag. https://doi.org/10.1007/0-387-34799-2_8

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