Discrete Logarithms in Generalized Jacobians

Authors Steven D. Galbraith, Benjamin Andrew Smith

Publication date 2 October 2006

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Abstract: D'ech`ene has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal gives rise to a group isomorphic to the semidirect product of an elliptic curve and a multiplicative group of a finite field. We explain why her proposal has no advantages over simply taking the direct product of groups. We then argue that generalized Jacobians offer poorer security and efficiency than standard Jacobians.

This page was built for publication: Discrete Logarithms in Generalized Jacobians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477970)