Efficient construction of secure hyperelliptic discrete logarithm problems

@inproceedings{Chao1997EfficientCO,
  title={Efficient construction of secure hyperelliptic discrete logarithm problems},
  author={Jinhui Chao and Nori Matsuda and Shigeo Tsujii},
  booktitle={ICICS},
  year={1997}
}
Hyperelliptic curves have been used to define discrete logarithm problems as cryptographic one-way functions. However, no efficient algorithm for construction of secure hyperelliptic curves is known until now. In this paper, efficient algorithms are presented to construct secure discrete logarithm problems on hyperelliptic curves whose Jacobian varieties are either simple or isogenous to a product of simple abelian varieties. 
Fast Construction of Secure Discrete Logarithm Problems over Jacobian Varieties
TLDR
Efficient algorithms to calculate the CM type and ideal factorization of Frobenius endomorphisms of Jacobian varieties of hyperelliptic curves over finite fields F p in polynomial time of log p are presented.
On the Performance of Hyperelliptic Cryptosystems
  • N. Smart
  • Mathematics, Computer Science
    EUROCRYPT
  • 1999
TLDR
It is concluded that hyperelliptic curves offer no performance advantage over elliptic curves, and the implementation of the group law on such curves and how to generate suitable curves for use in cryptography is covered.
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n
TLDR
This work investigates the discrete logarithm problem over jacobians of hyperelliptic curves suitable for public-key cryptosystems, and presents hypelliptic cryptosSystems that resist against all known attacks.
Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
TLDR
New algorithms to find explicit models of hyperelliptic curves with CM are presented and it is shown that the proposed algorithm for invariants lifting has complexity of a polynomial time in the discriminant of the CM field.
Speeding up the Discrete Log Computation on Curves with Automorphisms
We show how to speed up the discrete log computations on curves having automorphisms of large order, thus generalizing the attacks on anomalous binary elliptic curves. This includes the first known
Advances in Cryptology — EUROCRYPT ’99
  • J. Stern
  • Computer Science, Mathematics
    Lecture Notes in Computer Science
  • 1999
We show that if the private exponent d used in the RSA public-key cryptosystem is less than N then the system is insecure. This is the first improvement over an old result of Wiener showing that when
Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings
Elliptic curves over number fields with CM can be used to design non-isogenous elliptic cryptosystems over finite fields efficiently. The existing algorithm to huild such CM curves, so-called the CM
A RAPID GENERATION SCHEME OF LARGE PRIMES
TLDR
A rapid generation scheme of RSA, and techniques for the related software implementation were presented, to speed up the modular multiplication and squaring, Montgomery's algorithms were used with sliding window method.
Efficient algorithms for the Jacobian variety of hyperelliptic curves $y^2=x^p-x+1$ over a finite field of odd characteristic $p$
We develop efficient algorithms for the Jacobian of the hyperelliptic curve defined by the equation y2=xp-x+1 over a finite field F p n of odd characteristic p. We first determine the zeta function
A New Public-Key Cryptosystem as Secure as Factoring
TLDR
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries.
...
...

References

SHOWING 1-10 OF 53 REFERENCES
Elliptic curve cryptosystems
TLDR
The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems
The jacobian of hyperelliptic curves, including elliptic curves as a special case, offers a good primitive for cryptosystems, since cryptosystems (discrete logarithms) based on the jacobians seem to
Elliptic curve public key cryptosystems
  • A. Menezes
  • Mathematics, Computer Science
    The Kluwer international series in engineering and computer science
  • 1997
TLDR
In conclusion, the proposed solution to the Elliptic Curve Logarithm Problem is a simple one-size-fits-all approach that can be applied to many different types of cryptosystems.
Use of Elliptic Curves in Cryptography
  • V. Miller
  • Computer Science, Mathematics
    CRYPTO
  • 1985
TLDR
An analogue of the Diffie-Hellmann key exchange protocol is proposed which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
TLDR
A design strategy of elliptic curves whose extension degrees needed for reduction attacks have a controllable lower boundary, based on the complex multiplication fields method of Atkin and Morain over prime fields is presented.
Elliptic Curves and Their Applications to Cryptography - an introduction
  • A. Enge
  • Mathematics, Computer Science
  • 1999
TLDR
This chapter discusses the group law on Elliptic Curves over Finite Fields and the Discrete Logarithm Problem, and some of theorems related to this problem.
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields
TLDR
This paper gives a heuristic argument that under certain assumptions, there exists a c e ℜ>0 such that for all sufficiently large g e Z>0, for all odd primes p with log p ≤ (2g + 1).
ELLIPTIC CURVES AND PRIMALITY PROVING
TLDR
The Elliptic Curve Primality Proving algorithm - ECPP - is described, which can prove the primality of 100-digit numbers in less than five minutes on a SUN 3/60 workstation, and can treat all numbers with less than 1000 digits in a reasonable amount of time using a distributed implementation.
Computing in the Jacobian of a hyperelliptic curve
TLDR
A reduction algorithm is presented which is asymptotically faster than that of Gauss when the genus g is very large and the Jacobian of a hyperelliptic curve is studied.
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
TLDR
A deterministic algorithm to compute the number of F^-points of an elliptic curve that is defined over a finite field Fv and which is given by a Weierstrass equation is presented.
...
...