Results 291 to 300 of about 2,144,780 (355)
Some of the next articles are maybe not open access.
Computational Algebra, 2019
A plane curve is the set of the form {(x, y) : f(x, y) = 0} where f(x, y) is a polynomial in two variables. There are many familiar examples of plane curves: for example, the circle (x−3)+(y−2) = 4 is a plane curve, as one sees by taking f(x, y) to be (x−
James S Milne
semanticscholar +1 more source
A plane curve is the set of the form {(x, y) : f(x, y) = 0} where f(x, y) is a polynomial in two variables. There are many familiar examples of plane curves: for example, the circle (x−3)+(y−2) = 4 is a plane curve, as one sees by taking f(x, y) to be (x−
James S Milne
semanticscholar +1 more source
Elliptic Curve Cryptosystems [PDF]
Indian Journal of Applied Research, 2011 This paper deals with an implementation of Elliptic Curve Cryptosystem. Cryptography (or cryptology) from Greek word kryptos, "hidden, secret"; and graph, "writing" is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics, computer science, and engineering. Applications of cryp- tography include ATM
Dr.K.V.Durgaprasad Dr.K.V.Durgaprasad +1 more
openaire +1 more source
Journal of Econometrics, 1989
A family of elliptic Lorenz curves is proposed for fitting grouped income data. The associated distribution and density functions are displayed together with the Gini indices. Estimation procedures are discussed. Comparisons are made with alternative models using Australian 1967--68 income data.
JoséA. Villaseñor, Barry C. Arnold
openaire +3 more sources
A family of elliptic Lorenz curves is proposed for fitting grouped income data. The associated distribution and density functions are displayed together with the Gini indices. Estimation procedures are discussed. Comparisons are made with alternative models using Australian 1967--68 income data.
JoséA. Villaseñor, Barry C. Arnold
openaire +3 more sources
2020
Elliptic-curve cryptography (ECC) represents a public-key cryptography approach. It is based on the algebraic structure of elliptic curves over finite fields. ECC can be used in cryptography applications and primitives, such as key agreement, digital signature, and pseudo-random generators.
Marius Iulian Mihailescu +1 more
openaire +2 more sources
Elliptic-curve cryptography (ECC) represents a public-key cryptography approach. It is based on the algebraic structure of elliptic curves over finite fields. ECC can be used in cryptography applications and primitives, such as key agreement, digital signature, and pseudo-random generators.
Marius Iulian Mihailescu +1 more
openaire +2 more sources
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 +3 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 +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.
Clifford A. Reiter +2 more
openaire +2 more sources
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.
Clifford A. Reiter +2 more
openaire +2 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.
Tanja Lange, Christophe Doche
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.
Tanja Lange, Christophe Doche
openaire +2 more sources
Elliptic curves with abelian division fields
, 2015Let E be an elliptic curve over $$\mathbb {Q}$$Q, and let $$n\ge 1$$n≥1. The central object of study of this article is the division field $$\mathbb {Q}(E[n])$$Q(E[n]) that results by adjoining to $$\mathbb {Q}$$Q the coordinates of all n-torsion points ...
Enrique González–Jiménez +1 more
semanticscholar +1 more source