English
Related papers

Related papers: The elliptic curve discrete logarithm problem and …

200 papers

In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…

Analysis of PDEs · Mathematics 2013-03-01 Juan J. Manfredi , Adam M. Oberman , Alex P. Svirodov

This article gives an elementary computational proof of the group law for Edwards elliptic curves following Bernstein, Lange, et al., Edwards, and Friedl. The associative law is expressed as a polynomial identity over the integers that is…

Algebraic Geometry · Mathematics 2016-10-18 Thomas Hales

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

For an elliptic curve $E$ defined over the field $\mathbb{C}$ of complex numbers, we classify all translates of elliptic curves in $E^3$ such that the $x$-coordinates satisfy a linear equation. This classification enables us to establish a…

Number Theory · Mathematics 2023-10-27 Jerson Caro , Natalia Garcia-Fritz

The decision-Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for…

Number Theory · Mathematics 2007-05-23 Steven Galbraith , Victor Rotger

We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields $\mathbb{F}_{q^3}$. It is based on a transfer: First an $\mathbb{F}_q$-rational $(\ell,\ell,\ell)$-isogeny from the Weil restriction of the…

Cryptography and Security · Computer Science 2023-08-16 Song Tian

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the…

Number Theory · Mathematics 2018-12-12 Ilya Mironov , Anton Mityagin , Kobbi Nissim

The classification of elliptic curves E over the rationals Q is studied according to their torsion subgroups E_{tors}(Q) of rational points. Explicit criteria for the classification are given when E_{tors}(Q) are cyclic groups with even…

Number Theory · Mathematics 2007-05-23 Derong Qiu , Xianke Zhang

Let $E/\mathbb Q$ be an elliptic curve, let $P\in E(\mathbb Q)$ be non-torsion, and let $(D_n)$ be the associated elliptic divisibility sequence. We study when a product \[ \prod_{i=1}^k D_{n_i} \] can be a $\rho$-th power, where $\rho$ is…

Number Theory · Mathematics 2026-05-26 Dongyeon Kym

The main difficulty in studying numerical method for stochastic evolution equations (SEEs) lies in the treatment of the time discretization (J. Printems. [ESAIM Math. Model. Numer. Anal. (2001)]). Although fruitful results on numerical…

Numerical Analysis · Mathematics 2023-04-03 Jialin Hong , Derui Sheng , Tau Zhou

A new characterization of rational torsion subgroups of elliptic curves is found, for points of order greater than 4, through the existence of solution for systems of Thue equations.

Number Theory · Mathematics 2011-02-19 Irene Garcia-Selfa , Jose M. Tornero

For an elliptic curve $E$ over $K$, the Birch and Swinnerton-Dyer conjecture predicts that the rank of Mordell-Weil group $E(K)$ is equal to the order of the zero of $L(E_{/ K},s)$ at $s=1$. In this paper, we shall give a proof for elliptic…

Number Theory · Mathematics 2022-11-30 Kazuma Morita

We prove the existence and uniqueness of weak solution of a Neumann boundary problem for an elliptic partial differential equation (PDE for short) with a singular divergence term which can only be understood in a weak sense. A probabilistic…

Probability · Mathematics 2018-04-24 Xue Yang , Jing Zhang

We prove regularity estimates for weak solutions to the Dirichlet problem for a divergence form elliptic operator. We give $L^p$ estimates for the second derivative for $p<2$. Our work generalizes results due to Miranda [28].

Analysis of PDEs · Mathematics 2014-11-17 David Cruz-Uribe , Kabe Moen , Scott Rodney

This article gives an elementary computational proof of the group law for Edwards elliptic curves. The associative law is expressed as a polynomial identity over the integers that is directly checked by polynomial division. Unlike other…

Algebraic Geometry · Mathematics 2020-04-28 Thomas Hales , Rodrigo Raya

Short Weierstrass's elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problems was widely used in Cryptographic applications. This paper introduces a new security notation 'trusted security' for computation methods of…

Cryptography and Security · Computer Science 2022-08-04 Kunal Abhishek , E. George Dharma Prakash Raj

It is well known that every solution of an elliptic equation is analytic if its coefficients are analytic. However, less is known about the ultra-analyticity of such solutions. This work addresses the problem of elliptic equations with…

Analysis of PDEs · Mathematics 2024-09-12 Hongjie Dong , Ming Wang

For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…

Number Theory · Mathematics 2015-10-08 László Mérai , Arne Winterhof

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

Number Theory · Mathematics 2016-01-15 David Kohel

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

Symbolic Computation · Computer Science 2018-01-17 Javad Doliskani