A family of implementation-friendly BN elliptic curves

For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it provides with relatively small keys and to its ability to create very efficient and multifunctional cryptographic schemes by means of bilinear pairings. Pairings require pairing-friendly elliptic curves and among the possible choices, Barreto-Naehrig (BN) curves arguably constitute one of the most versatile families. In this paper, we further expand the potential of the BN curve family. We describe BN curves that are not only computationally very simple to generate, but also specially suitable for efficient implementation on a very broad range of scenarios. We also present implementation results of the optimal ate pairing using such a curve defined over a 254-bit prime field. (C) 2001 Elsevier Inc. All rights reserved.

Algorithms and cryptographic protocols using elliptic curves

En els darrers anys, la criptografia amb corbes el.líptiques ha adquirit una importància creixent, fins a arribar a formar part en la actualitat de diferents estàndards industrials. Tot i que s'han dissenyat variants amb corbes el.líptiques de criptosistemes clàssics, com el RSA, el seu màxim interès rau en la seva aplicació en criptosistemes basats en el Problema del Logaritme Discret, com els de tipus ElGamal. En aquest cas, els criptosistemes el.líptics garanteixen la mateixa seguretat que els construïts sobre el grup multiplicatiu d'un cos finit primer, però amb longituds de clau molt menor. Mostrarem, doncs, les bones propietats d'aquests criptosistemes, així com els requeriments bàsics per a que una corba sigui criptogràficament útil, estretament relacionat amb la seva cardinalitat. Revisarem alguns mètodes que permetin descartar corbes no criptogràficament útils, així com altres que permetin obtenir corbes bones a partir d'una de donada. Finalment, descriurem algunes aplicacions, com són el seu ús en Targes Intel.ligents i sistemes RFID, per concloure amb alguns avenços recents en aquest camp.

Generalization of Vélu’s formulae for isogenies between elliptic curves

Given an elliptic curve E and a finite subgroup G, V ́lu’s formulae concern to a separable isogeny IG : E → E ′ with kernel G. In particular, for a point P ∈ E these formulae express the first elementary symmetric polynomial on the abscissas of the points in the set P + G as the difference between the abscissa of IG (P ) and the first elementary symmetric polynomial on the abscissas of the nontrivial points of the kernel G. On the other hand, they express Weierstraß coefficients of E ′ as polynomials in the coefficients of E and two additional parameters: w0 = t and w1 = w. We generalize this by defining parameters wn for all n ≥ 0 and giving analogous formulae for all the elementary symmetric polynomials and the power sums on the abscissas of the points in P +G. Simultaneously, we obtain an efficient way of performing computations concerning the isogeny when G is a rational group.

Volcanoes of l-isogenies of elliptic curves over finite fields: the case l=3

This paper is devoted to the study of the volcanoes of l-isogenies of elliptic curves over a finite field, focusing on their height as well as on the location of curves across its different levels. The core of the paper lies on the relationship between the l-Sylow subgroup of an elliptic curve and the level of the volcano where it is placed. The particular case l = 3 is studied in detail, giving an algorithm to determine the volcano of 3-isogenies of a given elliptic curve. Experimental results are also provided.

Algebraic Geometric Codes and their relation to Cryptography using Elliptic Curves

Communication is the process of transmitting data across channel. Whenever data is transmitted across a channel, errors are likely to occur. Coding theory is a stream of science that deals with finding efficient ways to encode and decode data, so that any likely errors can be detected and corrected. There are many methods to achieve coding and decoding. One among them is Algebraic Geometric Codes that can be constructed from curves. Cryptography is the science ol‘ security of transmitting messages from a sender to a receiver. The objective is to encrypt message in such a way that an eavesdropper would not be able to read it. A eryptosystem is a set of algorithms for encrypting and decrypting for the purpose of the process of encryption and decryption. Public key eryptosystem such as RSA and DSS are traditionally being prel‘en‘ec| for the purpose of secure communication through the channel. llowever Elliptic Curve eryptosystem have become a viable altemative since they provide greater security and also because of their usage of key of smaller length compared to other existing crypto systems. Elliptic curve cryptography is based on group of points on an elliptic curve over a finite field. This thesis deals with Algebraic Geometric codes and their relation to Cryptography using elliptic curves. Here Goppa codes are used and the curves used are elliptic curve over a finite field. We are relating Algebraic Geometric code to Cryptography by developing a cryptographic algorithm, which includes the process of encryption and decryption of messages. We are making use of fundamental properties of Elliptic curve cryptography for generating the algorithm and is used here to relate both.

Transcendental Brauer groups of products of CM elliptic curves

Let L be a number field and let E/L be an elliptic curve with complex multiplication by the ring of integers O_K of an imaginary quadratic field K. We use class field theory and results of Skorobogatov and Zarhin to compute the transcendental part of the Brauer group of the abelian surface ExE. The results for the odd order torsion also apply to the Brauer group of the K3 surface Kum(ExE). We describe explicitly the elliptic curves E/Q with complex multiplication by O_K such that the Brauer group of ExE contains a transcendental element of odd order. We show that such an element gives rise to a Brauer-Manin obstruction to weak approximation on Kum(ExE), while there is no obstruction coming from the algebraic part of the Brauer group.

Shadow lines in the arithmetic of elliptic curves

Let E/Q be an elliptic curve and p a rational prime of good ordinary reduction. For every imaginary quadratic field K/Q satisfying the Heegner hypothesis for E we have a corresponding line in E(K)\otimes Q_p, known as a shadow line. When E/Q has analytic rank 2 and E/K has analytic rank 3, shadow lines are expected to lie in E(Q)\otimes Qp. If, in addition, p splits in K/Q, then shadow lines can be determined using the anticyclotomic p-adic height pairing. We develop an algorithm to compute anticyclotomic p-adic heights which we then use to provide an algorithm to compute shadow lines. We conclude by illustrating these algorithms in a collection of examples.

Zeta and L-functions of elliptic curves

In questa tesi si studiano alcune proprietà fondamentali delle funzioni Zeta e L associate ad una curva ellittica. In particolare, si dimostra la razionalità della funzione Zeta e l'ipotesi di Riemann per due famiglie specifiche di curve ellittiche. Si studia poi il problema dell'esistenza di un prolungamento analitico al piano complesso della funzione L di una curva ellittica con moltiplicazione complessa, attraverso l'analisi diretta di due casi particolari.

Parametrizations of elliptic curves by Shimura curves and by classical modular curves

Fix an isogeny class

Euler characteristics and elliptic curves

Let E be a modular elliptic curve over ℚ, without complex multiplication; let p be a prime number where E has good ordinary reduction; and let F∞ be the field obtained by adjoining to ℚ all p-power division points on E. Write G∞ for the Galois group of F∞ over ℚ. Assume that the complex L-series of E over ℚ does not vanish at s = 1. If p ⩾ 5, we make a precise conjecture about the value of the G∞-Euler characteristic of the Selmer group of E over F∞. If one makes a standard conjecture about the behavior of this Selmer group as a module over the Iwasawa algebra, we are able to prove our conjecture. The crucial local calculations in the proof depend on recent joint work of the first author with R. Greenberg.

Computational aspects of modular parametrizations of elliptic curves

Thesis (Ph.D.)--University of Washington, 2016-06

Estimate for the Number of Zeros of Abelian Integrals on Elliptic Curves

2000 Mathematics Subject Classification: Primary 34C07, secondary 34C08.

On rigid analytic uniformizations of Jacobians of Shimura curves

The main goal of this article is to give an explicit rigid analytic uniformization of the maximal toric quotient of the Jacobian of a Shimura curve over Q at a prime dividing exactly the level. This result can be viewed as complementary to the classical theorem of Cerednik and Drinfeld which provides rigid analytic uniformizations at primes dividing the discriminant. As a corollary, we offer a proof of a conjecture formulated by M. Greenberg in hispaper on Stark-Heegner points and quaternionic Shimura curves, thus making Greenberg's construction of local points on elliptic curves over Q unconditional.

Periodic orbits of integrable birational maps on the plane: blending dynamics and algebraic geometry, the Lyness' case

Contingut del Pòster presentat al congrés New Trends in Dynamical Systems

Rational periodic sequences for the Lyness recurrence

Consider the celebrated Lyness recurrence $x_{n+2}=(a+x_{n+1})/x_{n}$ with $a\in\Q$. First we prove that there exist initial conditions and values of $a$ for which it generates periodic sequences of rational numbers with prime periods $1,2,3,5,6,7,8,9,10$ or $12$ and that these are the only periods that rational sequences $\{x_n\}_n$ can have. It is known that if we restrict our attention to positive rational values of $a$ and positive rational initial conditions the only possible periods are $1,5$ and $9$. Moreover 1-periodic and 5-periodic sequences are easily obtained. We prove that for infinitely many positive values of $a,$ positive 9-period rational sequences occur. This last result is our main contribution and answers an open question left in previous works of Bastien \& Rogalski and Zeeman. We also prove that the level sets of the invariant associated to the Lyness map is a two-parameter family of elliptic curves that is a universal family of the elliptic curves with a point of order $n, n\ge5,$ including $n$ infinity. This fact implies that the Lyness map is a universal normal form for most birrational maps on elliptic curves.