Results 211 to 220 of about 2,556 (251)

Supersingular Elliptic Curves in Cryptography

2007
I will survey the checkered history of supersingular elliptic curves in cryptography, from their first consideration in the seminal papers of Koblitz and Miller, to their rejection after the discovery of the Weil and Tate pairing attacks on the discrete logarithm problem for these curves, and concluding with their resurrection alongside the discovery ...
openaire   +1 more source

Elliptic curve cryptography

1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
Elliptic curve (EC) public key cryptosystems were proposed independently in 1985 by Victor Miller and Neal Koblitz and are gaining favor as an efficient and attractive alternative to the more conventional public key cryptosystems (e.g., RSA) in some applications.
openaire   +1 more source

Elliptic Curves and Cryptography

2014
The subject of elliptic curves encompasses a vast amount of mathematics. Our aim in this section is to summarize just enough of the basic theory for cryptographic applications. For additional reading, there are a number of survey articles and books devoted to elliptic curve cryptography [14, 68, 81, 135], and many others that describe the number ...
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman   +2 more
openaire   +1 more source

Elliptic Curves in Cryptography

1999
In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems. Elliptic curves offer major advances on older systems such as increased speed, less memory and smaller key sizes. As digital signatures become more and more important in the commercial world the use of elliptic curve-
Blake, I F, Seroussi, G, Smart, N P
openaire   +1 more source

Elliptic Curve Cryptography

2010
Elliptic curve cryptography, in essence, entails using the group of points on an elliptic curve as the underlying number system for public key cryptography. There are two main reasons for using elliptic curves as a basis for public key cryptosystems.
openaire   +1 more source

Elliptic curve cryptography

Proceedings of the 1st annual conference on Information security curriculum development, 2004
The use of Java in developing commercial Internet applications is growing very rapidly. A major requirement for e-commerce applications is the provision of security. In this work we consider Elliptic Curve Cryptography (ECC) because of the high level of security it provides with small key sizes.
openaire   +1 more source

Elliptic Curve Cryptography; Applications, Challenges, Recent Advances, and Future Trends: A Comprehensive Survey

Computer Science Review, 2023
Farhan Ullah, Shamsher Ullah
exaly  

Elliptic Curve Cryptography

2018
Just the same as DLP, ECDLP (Elliptic Curve Discrete Logarithm Problem) is also hard to solve, so it is natural to think about designing cryptographic system based on ECDLP. In this chapter we shall first discuss the Elliptic Curve Discrete Logarithm Problem (ECDLP) and the classical solutions to ECDLP, then we shall present some popular and useful ...
openaire   +1 more source

Elliptic Curve Cryptography

International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021), 2022
openaire   +2 more sources

Elliptic Curves and Cryptography

2003
In the earlier cryptography articles, we have seen classical cryptosystems, various public-key cryptosystems and many primality tests. In this article we shall see how elliptic curves are used in cryptography. When public-key cryptography was introduced to the research community by Diffe and Hellman in 1976 [4], it represented an exciting innovation in
openaire   +1 more source