The group structures of automorphism groups of elliptic function fields over finite fields and their applications to optimal locally repairable codes

08/26/2020
by   Liming Ma, et al.
0

The automorphism group of an elliptic curve over an algebraically closed field is well known. However, for various applications in coding theory and cryptography, we usually need to apply automorphisms defined over a finite field. Although we believe that the automorphism group of an elliptic curve over a finite field is well known in the community, we could not find this in the literature. Nevertheless, in this paper we show the group structure of the automorphism group of an elliptic curve over a finite field. More importantly, we characterize subgroups and abelian subgroups of the automorphism group of an elliptic curve over a finite field. Despite of theoretical interest on this topic, our research is largely motivated by constructions of optimal locally repairable codes. The first research to make use of automorphism group of function fields to construct optimal locally repairable codes was given in a paper <cit.> where automorphism group of a projective line was employed. The idea was further generated to an elliptic curve in <cit.> where only automorphisms fixing the point at infinity were used. Because there are at most 24 automorphisms of an elliptic curve fixing the point at infinity, the locality of optimal locally repairable codes from this construction is upper bounded by 23. One of the main motivation to study subgroups and abelian subgroups of the automorphism group of an elliptic curve over a finite field is to remove the constraints on locality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2022

On Deep Holes of Elliptic Curve Codes

We give a method to construct deep holes for elliptic curve codes. For l...
research
02/07/2023

Multiplication polynomials for elliptic curves over finite local rings

For a given elliptic curve E over a finite local ring, we denote by E^∞ ...
research
07/05/2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an el...
research
10/19/2017

A Survey on Hardware Implementations of Elliptic Curve Cryptosystems

In the past two decades, Elliptic Curve Cryptography (ECC) have become i...
research
12/11/2017

Optimal locally repairable codes via elliptic curves

Constructing locally repairable codes achieving Singleton-type bound (we...
research
02/21/2023

An Elementary Formal Proof of the Group Law on Weierstrass Elliptic Curves in any Characteristic

Elliptic curves are fundamental objects in number theory and algebraic g...
research
07/16/2020

Area- Efficient VLSI Implementation of Serial-In Parallel-Out Multiplier Using Polynomial Representation in Finite Field GF(2m)

Finite field multiplier is mainly used in elliptic curve cryptography, e...

Please sign up or login with your details

Forgot password? Click here to reset