scholarly journals Construction of elliptic curves with cyclic groups over prime fields

2006 ◽  
Vol 73 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Naoya Nakazawa

The purpose of this article is to construct families of elliptic curves E over finite fields F so that the groups of F-rational points of E are cyclic, by using a representation of the modular invariant function by a generator of a modular function field associated with the modular group Γ0(N), where N = 5, 7 or 13.

2019 ◽  
Vol 15 (03) ◽  
pp. 469-477
Author(s):  
Igor E. Shparlinski

Over the last two decades, there has been a wave of activity establishing the Sato-Tate kind of distribution in various families of elliptic curves over prime fields. Typically the goal here is to prove this for families which are as thin as possible. We consider a function field analogue of this question, that is, for high degree extensions of a finite field where new effects allow us to study families, which are much thinner that those typically investigated over prime fields.


2010 ◽  
Vol 53 (1) ◽  
pp. 87-94
Author(s):  
Dragos Ghioca

AbstractWe prove that the group of rational points of a non-isotrivial elliptic curve defined over the perfect closure of a function field in positive characteristic is finitely generated.


Author(s):  
Keisuke Hakuta

Elliptic curves have a wide variety of applications in computational number theory such as elliptic curve cryptography, pairing based cryptography, primality tests, and integer factorization. Mishra and Gupta (2008) have found an interesting property of the sets of elliptic curves in simplified Weierstrass form (or short Weierstrass form) over prime fields. The property is that one can induce metrics on the sets of elliptic curves in simplified Weierstrass form over prime fields of characteristic greater than three. Later, Vetro (2011) has found some other metrics on the sets of elliptic curves in simplified Weierstrass form over prime fields of characteristic greater than three. However, to our knowledge, no analogous result is known in the characteristic two case. In this paper, we will prove that one can induce metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two.


2012 ◽  
Vol 08 (04) ◽  
pp. 1087-1097 ◽  
Author(s):  
STEFANIA FANALI ◽  
MASSIMO GIULIETTI

The Stöhr–Voloch approach has been largely used to deal with the classical problem of estimating the number of rational points of a Fermat curve over a finite field. The same method actually applies to any curve admitting as an automorphism group the direct product of two cyclic groups C1 and C2 of the same size k, and such that the quotient curves with respect to both C1 and C2 are rational. In this paper such a curve is called a generalized Fermat curve. Our main achievement is that of extending some known results on Fermat curves to generalized Fermat curves.


Author(s):  
Amirmehdi Yazdani Kashani ◽  
Hassan Daghigh

Many elliptic curve cryptosystems require an encoding function from a finite field Fq into Fq-rational points of an elliptic curve. We propose a uniform encoding to general elliptic curves over Fq. We also discuss about an injective case of SWU encoing for hyperelliptic curves of genus 2. Moreover we discuss about an injective encoding for elliptic curves with a point of order two over a finite field and present a description for these elliptic curves.


2006 ◽  
Vol 02 (02) ◽  
pp. 267-288 ◽  
Author(s):  
E. KOWALSKI

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve E/Fq(C) over a function field over a finite field that have rank ≥ 2, and for their average rank. The main tools are constructions and results of Katz and uniform versions of the Chebotarev density theorem for varieties over finite fields. Moreover, we conditionally derive a bound in some cases where the degree of the conductor is unbounded.


Author(s):  
Anna ILYENKO ◽  
Sergii ILYENKO ◽  
Yana MASUR

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.


1971 ◽  
Vol 43 ◽  
pp. 199-208 ◽  
Author(s):  
Goro Shimura

1. As Hecke showed, every L-function of an imaginary quadratic field K with a Grössen-character γ is the Mellin transform of a cusp form f(z) belonging to a certain congruence subgroup Γ of SL2(Z). We can normalize γ so that


Sign in / Sign up

Export Citation Format

Share Document