Elliptic curve cryptosystems([19, 25]) are based on the elliptic curve discrete logarithm problem(ECDLP). If elliptic curve cryptosystems avoid FR-reduction([11, 17]) and anomalous elliptic curve over Fq ([34, 3, 36]), then with current knowledge we can construct elliptic curve cryptosystems over a smaller de nition eld. ECDLP has an interesting property that the security deeply depends on elli...

Elliptic curve cryptosystems([19],[25]) are based on the elliptic curve discrete logarithm problem(ECDLP). If elliptic curve cryptosystems avoid FRreduction([11],[17]) and anomalous elliptic curve over Fq ([3], [33], [35]), then with current knowledge we can construct elliptic curve cryptosystems over a smaller definition field. ECDLP has an interesting property that the security deeply depends...

we prove the existence of steady 2-dimensional flows, containing a bounded vortex, and approaching a uniform flow at infinity. the data prescribed is the rearrangement class of the vorticity field. the corresponding stream function satisfies a semilinear elliptic partial differential equation. the result is proved by maximizing the kinetic energy over all flows whose vorticity fields are rearra...

in this paper‎, ‎we prove a multiplicity result for some biharmonic elliptic equation of kirchhoff type and involving nonlinearities with critical exponential growth at infinity‎. ‎using some variational arguments and exploiting the symmetries of the problem‎, ‎we establish a multiplicity result giving two nontrivial solutions‎.

Stange, generalizingWard’s elliptic divisibility sequences, introduced elliptic nets, and showed an equivalence between elliptic nets and elliptic curves. This note relates Stange’s recursion for elliptic nets and the Coxeter group F4.

‎using nehari manifold methods and mountain pass theorem‎, ‎the existence of nontrivial and radially symmetric solutions for a class of $p$-kirchhoff-type system are established.

In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which has small trace. Both methods use the identity which expresses multiplication-by-m maps by polynomials of Frobenius maps. Both are applicable for a large family of elliptic curves and more efficient than any other metho...

Selection Algorithm and Generation Algorithm of elliptic curves have been the focus of research and hotspot of the Elliptic Curve Cryptosystem. This paper discusses a random elliptic curve realization method of Embedded Mobile Equipment, the SEA algorithm and its improved algorithm from Elliptic Curve's selection, Elliptic Curve's structure and Elliptic Curve's generation. Ensuring that the emb...