Results 291 to 300 of about 125,110 (329)
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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 Curve Cryptography Engineering
Proceedings of the IEEE, 2006In recent years, elliptic curve cryptography (ECC) has gained widespread exposure and acceptance, and has already been included in many security standards. Engineering of ECC is a complex, interdisciplinary research field encompassing such fields as mathematics, computer science, and electrical engineering.
CILARDO, Alessandro +3 more
openaire +4 more sources
Holomorphic Triples on Elliptic Curves
Results in Mathematics, 2007Here we study the α-stability for holomorphic triples over curves of genus g = 1. We provide necessary and sufficient conditions for the moduli space of α-stable triples to be non-empy and, in these cases, we show that it is smooth and irreducible.
PASOTTI, Stefano, PRANTIL F.
openaire +4 more sources
2002
Describes in two pages the history of ECM, how it works at high level, improvements to the method, and some applications.
openaire +6 more sources
Describes in two pages the history of ECM, how it works at high level, improvements to the method, and some applications.
openaire +6 more sources
The Geometry of Elliptic Curves
1986Elliptic curves, our principal object of study in this book, are curves of genus one having a specified base point. Our ultimate goal, as the title of the book indicates, is to study the arithmetic properties of these curves. In other words, we will be interested in analyzing their points defined over arithmetically interesting fields, such as finite ...
openaire +2 more sources