Name
Abstract | ||
|---|---|---|
Jacobian varieties of hyperelliptic curves have been recently used in cryptosystems. However, lacking of efficient point-counting algorithms for such varieties over finite fields makes the design of secure cryptosystems very difficult. This paper presents efficient algorithms to calculate the CM type and ideal factorization of Frobenius endomorphisms of Jacobian varieties over finite fields F-p in polynomial time of log p. Then we show how to construct secure hyperelliptic curves of small genera over large prime fields F-p in polynomial time of log p. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/978-0-387-35515-3_25 | SEC |
Keywords | Field | DocType |
fast construction,secure discrete logarithm problems,jacobian varieties,discrete logarithm problem | Prime (order theory),Discrete mathematics,Hyperelliptic curve,Finite field,Jacobian matrix and determinant,Computer science,Computer security,Abelian variety,Factorization,Time complexity,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
47 | 1571-5736 | 0-7923-7914-4 |
Citations | PageRank | References |
1 | 0.37 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinhui Chao | 1 | 1 | 0.37 |
| Kazuto Matsuo | 2 | 62 | 6.44 |
| Shigeo Tsujii | 3 | 598 | 131.15 |