نتایج جستجو برای: elliptic curve cryptography

تعداد نتایج: 190018  

2008
Alex Halperin

We discuss Chapter 6 from Silverman & Tate’s Rational Points on Elliptic Curves, in which the authors outline a means of proving Kronecker’s Jugendtraum for Q and Q(i). One considers C[n], the kernel of the multiplication-by-n map on an elliptic curve C. After defining the number field Q(C[n]), we examine instances in which its Galois group over a field K is abelian. For the elliptic curve

2005

We discuss abelian variety and use it to generalize the concept of elliptic curve we discussed in the class. We state some of the basic properties of abelian variety and in particular 1-dimensional abelian variety. The main result of this report is to show that elliptic curve is that the only 1-dimensional abelian variety.

2005
Zhaohui Cheng Manos Nistazakis

Pairing-based cryptosystems have been developing very fast in the last few years. As the key primitive, pairing is also the heaviest operation in these systems. The performance of pairing affects the application of the schemes in practice. In this report, we summarise the formulas of the Tate pairing operation on elliptic curves in different coordinate systems and describe a few observations of...

2012
WEI HO

A large part of modern arithmetic geometry is dedicated to or motivated by the study of rational points on varieties. For an elliptic curve over Q, the set of rational points forms a finitely generated abelian group. The ranks of these groups, when ranging over all elliptic curves, are conjectured to be evenly distributed between rank 0 and rank 1, with higher ranks being negligible. We will de...

Journal: :Inf. Process. Lett. 2000
Akira Higuchi Naofumi Takagi

A new fast addition algorithm on an elliptic curve over GF(2n) using the projective coordinates with x =X/Z and y = Y/Z2 is proposed.  2000 Elsevier Science B.V. All rights reserved.

2002
Shigeki Matsutani Yoshihiro Ônishi

(−1)(1!2! · · · (n− 1)!) σ(nu) σ(u)n = ∣∣∣∣∣∣∣ ℘ ℘ · · · ℘ ℘ ℘ · · · ℘ .. .. . . . .. ℘ ℘ · · · ℘ ∣∣∣∣∣∣∣ (u). (0.2) Although this formula can be obtained by a limiting process from (0.1), it was found before [FS] by the paper of Kiepert [K]. If we set y(u) = 1 2℘ (u) and x(u) = ℘(u), then we have an equation y(u) = x(u)+ · · · , that is a defining equation of the elliptic curve to which the fu...

2013
Jerome William Hoffman

This is an exposition of some of the main features of the theory of elliptic curves and modular forms.

2004
SHINJI FUKUHARA NORIKO YUI

We introduce an elliptic analogue of the Apostol sums, which we call elliptic Apostol sums. These sums are defined by means of certain elliptic functions with a complex parameter τ having positive imaginary part. When τ → i∞, these elliptic Apostol sums represent the well-known Apostol generalized Dedekind sums. Also these elliptic Apostol sums are modular forms in the variable τ . We obtain a ...

Journal: :Appl. Math. Lett. 2005
M. Mahboob P. Schiavone

We derive a general expression for an interface parameter which makes possible the design of a neutral elliptic inhomogeneity when the stress field in the surrounding matrix is a polynomial function of nth order and the composite is subjected to antiplane shear deformations. © 2005 Elsevier Ltd. All rights reserved.

Journal: :IACR Cryptology ePrint Archive 2005
Steven D. Galbraith

To help motivate the Weil pairing, we discuss it in the context of elliptic curves over the field of complex numbers.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید