scholarly journals The Chow group modulo $l$ for the triple product of a general elliptic curve

2000 ◽  
Vol 4 (4) ◽  
pp. 987-996 ◽  
Author(s):  
Chad Schoen
2019 ◽  
Vol 7 ◽  
Author(s):  
DANIEL KRIZ ◽  
CHAO LI

Given an elliptic curve$E$over$\mathbb{Q}$, a celebrated conjecture of Goldfeld asserts that a positive proportion of its quadratic twists should have analytic rank 0 (respectively 1). We show that this conjecture holds whenever$E$has a rational 3-isogeny. We also prove the analogous result for the sextic twists of$j$-invariant 0 curves. For a more general elliptic curve$E$, we show that the number of quadratic twists of$E$up to twisting discriminant$X$of analytic rank 0 (respectively 1) is$\gg X/\log ^{5/6}X$, improving the current best general bound toward Goldfeld’s conjecture due to Ono–Skinner (respectively Perelli–Pomykala). To prove these results, we establish a congruence formula between$p$-adic logarithms of Heegner points and apply it in the special cases$p=3$and$p=2$to construct the desired twists explicitly. As a by-product, we also prove the corresponding$p$-part of the Birch and Swinnerton–Dyer conjecture for these explicit twists.


Author(s):  
J. Chris Eilbeck ◽  
Matthew England ◽  
Yoshihiro Ônishi

We present new addition formulae for the Weierstrass functions associated with a general elliptic curve. We prove the structure of the formulae in n -variables and give the explicit addition formulae for the 2- and 3-variable cases. These new results were inspired by new addition formulae found in the case of an equianharmonic curve, which we can now observe as a specialization of the results here. The new formulae, and the techniques used to find them, also follow the recent work for the generalization of Weierstrass functions to curves of higher genus.


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.


Author(s):  
Kazuki NAGANUMA ◽  
Takashi SUZUKI ◽  
Hiroyuki TSUJI ◽  
Tomoaki KIMURA

Author(s):  
Mohd Javed ◽  
Khaleel Ahmad ◽  
Ahmad Talha Siddiqui

WiMAX is the innovation and upgradation of 802.16 benchmarks given by IEEE. It has numerous remarkable qualities, for example, high information rate, the nature of the service, versatility, security and portability putting it heads and shoulder over the current advancements like broadband link, DSL and remote systems. Though like its competitors the concern for security remains mandatory. Since the remote medium is accessible to call, the assailants can undoubtedly get into the system, making the powerless against the client. Many modern confirmations and encryption methods have been installed into WiMAX; however, regardless it opens with up different dangers. In this paper, we proposed Elliptic curve Cryptography based on Cellular Automata (EC3A) for encryption and decryption the message for improving the WiMAX security


Sign in / Sign up

Export Citation Format

Share Document