نتایج جستجو برای: convexconcave elliptic

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

2006
FLORIAN BREUER

Let k be a global field, k a separable closure of k, and Gk the absolute Galois group Gal(k/k) of k over k. For every σ ∈ Gk, let k σ be the fixed subfield of k under σ. Let E/k be an elliptic curve over k. We show that for each σ ∈ Gk, the Mordell-Weil group E(k σ ) has infinite rank in the following two cases. Firstly when k is a global function field of odd characteristic and E is parametriz...

2008
Shigeki Matsutani YOSHIHIRO ÔNISHI Yoshihiro Ônishi

Although this formula can be obtained by a limiting process from (0.1), it was found before [11] by the paper of Kiepert [13]. 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 functions ℘(u) and σ(u) are attached. Here the complex number u and the coordinate (x(u), y(u)) correspond by the equ...

2006
Zhongwei Shen ZHONGWEI SHEN

Let Lε = −div ` A ` x ε ́ ∇ ́ , ε > 0 be a family of second order elliptic operators with real, symmetric coefficients on a bounded Lipschitz domain Ω in Rn, subject to the Dirichlet boundary condition. Assuming that A(x) is periodic and belongs to VMO, we show that there exists δ > 0 independent of ε such that Riesz transforms ∇(Lε)−1/2 are uniformly bounded on Lp(Ω), where 1 < p < 3+δ if n ≥ 3,...

2009
ANDREW V. SUTHERLAND

The modular curve X1(N) parametrizes elliptic curves with a point of order N . For N ≤ 50 we obtain plane models for X1(N) that have been optimized for fast computation, and provide explicit birational maps to transform a point on our model of X1(N) to an elliptic curve. Over a finite field Fq, these allow us to quickly construct elliptic curves containing a point of order N , and can accelerat...

2012
BRENDAN CREUTZ

For every prime p we give infinitely many examples of torsors under abelian varieties over Q that are locally trivial but not divisible by p in the Weil-Châtelet group. We also give an example of a locally trivial torsor under an elliptic curve over Q which is not divisible by 4 in the Weil-Châtelet group. This gives a negative answer to a question of Cassels.

1997
Eugene Perevalov

We consider F-theory compactifications on a mirror pair of elliptic Calabi–Yau threefolds. This yields two different six-dimensional theories, each of them being nonperturbatively equivalent to some compactification of heterotic strings on a K3 surface S with certain bundle data E → S. We find evidence for a transformation of S together with the bundle that takes one heterotic model to the othe...

2008
Richard F. Bass Edwin Perkins

A new technique for proving uniqueness of martingale problems is introduced. The method is illustrated in the context of elliptic diffusions in Rd.

Journal: :IACR Cryptology ePrint Archive 2005
Keisuke Hakuta Hisayoshi Sato Tsuyoshi Takagi

In elliptic curve cryptosystems, scalar multiplications performed on the curves have much effect on the efficiency of the schemes, and many efficient methods have been proposed. In particular, recoding methods of the scalars play an important role in the performance of the algorithm used. For integer radices, non-adjacent form (NAF) and its generalizations (e.g., generalized non-adjacent form (...

Journal: :IACR Cryptology ePrint Archive 2008
Hüseyin Hisil Kenneth Koon-Ho Wong Gary Carter Ed Dawson

This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a wide range of applications. Notably, the new addition algorithm uses 8M for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature ...

1999
Yongfei Han Peng-Chor Leong Peng-Chong Tan Jiang Zhang

In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We present two novel algorithms for efficient implementation of field multiplication and modular reduction used frequently in an elliptic curve cryptosystem defined over GF (2). We provide a complexity study of the two algorithm...

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

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