Results 221 to 230 of about 4,574 (262)
Compressive sensing techniques based on secure data aggregation in WSNs. [PDF]
Sci RepMadkour ME +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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 +1 more source
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
American Journal of Mathematics, 1931
Zwei ebene Kurven heißen perspektiv, wenn zwischen den Punkten der ersten und den Tangenten der zweiten eine \((1,1)\)-Korrespondenz derart hergestellt werden kann, daß jede Tangente der zweiten durch den entsprechenden Punkt der ersten läuft. So sind z. B.
openaire +2 more sources
Zwei ebene Kurven heißen perspektiv, wenn zwischen den Punkten der ersten und den Tangenten der zweiten eine \((1,1)\)-Korrespondenz derart hergestellt werden kann, daß jede Tangente der zweiten durch den entsprechenden Punkt der ersten läuft. So sind z. B.
openaire +2 more sources
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography, 2000This paper surveys the elliptic curve cryptography that is based on the discrete logarithm problem. Compared to their counterparts in groups of integers, elliptic curves usually provide smaller keys and lower computational complexities. The paper gives a brief overview of elliptic curves, discusses the elliptic curve discrete logarithm problem and ...
Neal Koblitz +2 more
openaire +1 more source
Elliptic Curve Paillier Schemes
Journal of Cryptology, 2002This paper is concerned with generalisations of Paillier's probabilistic encryption scheme from the integers modulo a square to elliptic curves over rings. Paillier himself described two public key encryption schemes based on anomalous elliptic curves over rings. It is argued that these schemes are not secure.
openaire +3 more sources