scholarly journals On the Iwasawa invariants of elliptic curves

2000 ◽  
Vol 142 (1) ◽  
pp. 17-63 ◽  
Author(s):  
Ralph Greenberg ◽  
Vinayak Vatsal
2008 ◽  
Vol 04 (03) ◽  
pp. 403-422
Author(s):  
KAZUO MATSUNO

In this paper, we give an explicit formula describing the variation of the 2-adic Iwasawa λ-invariants attached to the Selmer groups of elliptic curves under quadratic twists. To prove this formula, we extend some results known for odd primes p, an analogue of Kida's formula proved by Hachimori and the author and a formula given by Greenberg and Vatsal, to the case where p = 2.


2017 ◽  
Vol 69 (4) ◽  
pp. 826-850 ◽  
Author(s):  
Antonio Lei ◽  
David Loeffler ◽  
Zerbes Sarah Livia

AbstractWe study the asymptotic behaviour of the Bloch-Kato-Shafarevich-Tate group of a modular form f over the cyclotomic ℤp-extension of ℚ under the assumption that f is non-ordinary at p. In particular, we give upper bounds of these groups in terms of Iwasawa invariants of Selmer groups defined using p-adic Hodge Theory. These bounds have the same form as the formulae of Kobayashi, Kurihara, and Sprung for supersingular elliptic curves.


Author(s):  
Henry McKean ◽  
Victor Moll
Keyword(s):  

2004 ◽  
Vol 9 (4) ◽  
pp. 331-348
Author(s):  
V. Garbaliauskienė

A joint universality theorem in the Voronin sense for L-functions of elliptic curves over the field of rational numbers is proved.


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.


Sign in / Sign up

Export Citation Format

Share Document