Results 281 to 290 of about 24,382 (331)
Some of the next articles are maybe not open access.
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 ...
Koblitz, Neal +2 more
openaire +1 more source
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 +3 more sources
2020
Elliptic curve cryptography is an important class of algorithms. There are currently implementations of elliptic curve being used in digital certificates and for key exchange. This class of algorithms provides robust security but with a substantially smaller key than RSA. In this chapter, we explore the basics of elliptic curve cryptography.
Marius Iulian Mihailescu +1 more
openaire +2 more sources
Elliptic curve cryptography is an important class of algorithms. There are currently implementations of elliptic curve being used in digital certificates and for key exchange. This class of algorithms provides robust security but with a substantially smaller key than RSA. In this chapter, we explore the basics of elliptic curve cryptography.
Marius Iulian Mihailescu +1 more
openaire +2 more sources
2021
In this chapter, we briefly motivate the use of asymmetric cryptography based on ECC systems for applications in resource-constrained devices like flash memory controllers. We review applications and fundamentals of elliptic curve cryptography, the corresponding one-way function, i.e. the so-called PM, as well as associated group laws.
+4 more sources
In this chapter, we briefly motivate the use of asymmetric cryptography based on ECC systems for applications in resource-constrained devices like flash memory controllers. We review applications and fundamentals of elliptic curve cryptography, the corresponding one-way function, i.e. the so-called PM, as well as associated group laws.
+4 more sources
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 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
2014The 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 +2 more
openaire +1 more source
Proceedings of the International Conference on Advances in Computing and Artificial Intelligence, 2011
Elliptic curve cryptosystems are based on ECDLP (Elliptic curve discrete logarithm problem) for their security. The best known method to solve ECDLP (pollard's rho algorithm) is fully exponential therefore Elliptic Curve Cryptosystems require substantially smaller key sizes for equivalent security as compared to other public key cryptosystems (RSA, DSA)
Sheetal Kalra, Sandeep K. Sood
openaire +1 more source
Elliptic curve cryptosystems are based on ECDLP (Elliptic curve discrete logarithm problem) for their security. The best known method to solve ECDLP (pollard's rho algorithm) is fully exponential therefore Elliptic Curve Cryptosystems require substantially smaller key sizes for equivalent security as compared to other public key cryptosystems (RSA, DSA)
Sheetal Kalra, Sandeep K. Sood
openaire +1 more source
Pairing-Based Cryptography on Elliptic Curves
Mathematics in Computer Science, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miret, Josep M. +2 more
openaire +2 more sources