Results 251 to 260 of about 890,810 (300)
The curves of elliptic nodes on K3 surfaces. [PDF]
Beitr Algebra GeomHuang J.
europepmc +1 more source
A De Giorgi conjecture on the regularity of minimizers of Cartesian area in 1D. [PDF]
Ann Univ Ferrara Sez 7 Sci MatBellettini G, Kholmatov SY.
europepmc +1 more source
A Security-Enhanced Certificateless Aggregate Signature-Based Conditional Privacy-Preserving Authentication Scheme for VANETs. [PDF]
Sensors (Basel)Wang R, Liu C, Zhang H, Jia M.
europepmc +1 more source
Locally Recoverable Codes with availability from a family of fibered surfaces. [PDF]
Des Codes CryptogrSalgado C, Vicino L.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computers & Graphics, 1994
Abstract The escape time behavior of a function associated with elliptic curves is studied via Julia sets and composite Mandelbrot sets. The Mandelbrot sets are composite in the sense that two critical points are followed.
Sandy D. Balkin +2 more
openaire +1 more source
Abstract The escape time behavior of a function associated with elliptic curves is studied via Julia sets and composite Mandelbrot sets. The Mandelbrot sets are composite in the sense that two critical points are followed.
Sandy D. Balkin +2 more
openaire +1 more source
Pacific Journal of Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gun, Sanoli, Murty, V. Kumar
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gun, Sanoli, Murty, V. Kumar
openaire +2 more sources
2003
The purpose of the present text is to give an elementary introduction to the arithmetic of elliptic curves over number fields from a computational point of view. This branch of number theory is particularly accessible to computer assisted calculations, and the authors make use of this feature by approaching the theory from a computational point of view.
Schmitt, S., Zimmer, H.
openaire +3 more sources
The purpose of the present text is to give an elementary introduction to the arithmetic of elliptic curves over number fields from a computational point of view. This branch of number theory is particularly accessible to computer assisted calculations, and the authors make use of this feature by approaching the theory from a computational point of view.
Schmitt, S., Zimmer, H.
openaire +3 more sources
2005
Elliptic curves constitute one of the main topics of this book. They have been proposed for applications in cryptography due to their fast group law and because so far no subexponential attack on their discrete logarithm problem (cf. Section 1.5) is known. We deal with security issues in later chapters and concentrate on the group arithmetic here.
Doche, C., Lange, T.
openaire +2 more sources
Elliptic curves constitute one of the main topics of this book. They have been proposed for applications in cryptography due to their fast group law and because so far no subexponential attack on their discrete logarithm problem (cf. Section 1.5) is known. We deal with security issues in later chapters and concentrate on the group arithmetic here.
Doche, C., Lange, T.
openaire +2 more sources
Rasterization of elliptic curves
Computers & Graphics, 1994Abstract An algorithm for automatically rasterizing an implicitly defined curve that is based on following sign changes and which avoids gradient computations is described. The algorithm is used to visualize families of elliptic curves.
Sandy D. Balkin +2 more
openaire +2 more sources
ELLIPTIC CURVES AND -ADIC ELLIPTIC TRANSCENDENCE
Bulletin of the Australian Mathematical Society, 2021AbstractWe prove a necessary and sufficient condition for isogenous elliptic curves based on the algebraic dependence ofp-adic elliptic functions. As a consequence, we give a short proof of thep-adic analogue of Schneider’s theorem on the linear independence ofp-adic elliptic logarithms of algebraic points on two nonisogenous elliptic curves defined ...
openaire +1 more source