A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields
暂无分享,去创建一个
[1] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..
[2] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[3] Carl Pomerance,et al. Rigorous, subexponential algorithms for discrete logarithms over finite fields , 1992 .
[4] D. Cantor. Computing in the Jacobian of a hyperelliptic curve , 1987 .
[5] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..
[6] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[7] E. Berlekamp. Factoring polynomials over large finite fields* , 1970, SYMSAC '71.
[8] D. Mumford. Tata Lectures on Theta I , 1982 .
[9] Costas S. Iliopoulos,et al. Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix , 1989, SIAM J. Comput..