Cryptographic protocols on real hyperelliptic curves

M. J. Jacobson; R. Scheidler; A. Stein

doi:10.3934/amc.2007.1.197

Article Contents

2007, Volume 1, Issue 2: 197-221. Doi: 10.3934/amc.2007.1.197

This issue Previous Article New upper bounds on codes via association schemes and linear programming Next Article Double circulant and quasi-twisted self-dual codes over $\mathbb F_5$ and $\mathbb F_7$

Cryptographic protocols on real hyperelliptic curves

1.
Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4
2.
Department of Mathematics and Statistics, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4
3.
Department of Mathematics, University of Wyoming, 1000 E. University Avenue, Laramie, WY 82071-3036

Received: September 2006

Revised: May 2007

Published: July 2007

Abstract / Introduction Related Papers Cited by

Abstract

We present public-key cryptographic protocols for key exchange, digital signatures, and encryption whose security is based on the presumed intractability of solving the principal ideal problem, or equivalently, the distance problem, in the real model of a hyperelliptic curve. Our protocols represent a significant improvement over existing protocols using real hyperelliptic curves. Theoretical analysis and numerical experiments indicate that they are comparable to the imaginary model in terms of efficiency, and hold much more promise for practical applications than previously believed.

Keywords:

Mathematics Subject Classification: Primary: 94A60, 14H45; Secondary: 14Q05.

Citation:

Article Metrics

HTML views() PDF downloads(272) Cited by(0)

Cryptographic protocols on real hyperelliptic curves

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Cryptographic protocols on real hyperelliptic curves

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content