Local duality and the discrete logarithm problem

Authors:
Ming-Deh Huang
Affiliations:
Department of Computer Science, University of Southern California, Los Angeles, CA
Venue:
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Year:
2011

Citing 4
Cited 0

A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Discrete Logarithms: The Effectiveness of the Index Calculus Method

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the computational complexity of Tate local duality is closely related to that of the discrete logarithm problem over finite fields. Local duality in the multiplicative case and the case of Jacobians of curves over p-adic local fields are considered. When the local field contains the necessary roots of unity, the case of curves over local fields is polynomial time reducible to the multiplicative case, and the multiplicative case is polynomial time equivalent to computing discrete logarithm in finite fields. When the local field dose not contains the necessary roots of unity, similar results can be obtained at the cost of going to an extension that does contain these roots of unity.