Jacobians of hyperelliptic curves for cryptography
Angelo Sonnino
Abstract
Angelo Sonnino
Abstract
Jacobians of hyperelliptic curves defined over a finite field are used in constructing cryptosystems based on discrete logarithm. The aim of this paper is to present some hyperelliptic curves defined over $\mathbb{F}_{4}$ whose Jacobians provide cryptosystems resisting the currently known attacks. The key tool for this purpose is the classification of $L$-polynomials of hyperelliptic curves defined over $\mathbb{F}_{4}$.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Jacobians of hyperelliptic curves defined over a finite field are used in constructing cryptosystems based on discrete logarithm. The aim of this paper is to present some hyperelliptic curves defined over $\mathbb{F}_{4}$ whose Jacobians provide cryptosystems resisting the currently known attacks. The key tool for this purpose is the classification of $L$-polynomials of hyperelliptic curves defined over $\mathbb{F}_{4}$.
Key concepts: Hyperelliptic curve cryptography, Hyperelliptic curve, Cryptography, Mathematics, Computer science, Elliptic curve cryptography, Algebra over a field, Computer security