Results 91 to 100 of about 21,677 (136)
Some of the next articles are maybe not open access.
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
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
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
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
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, 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
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
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
Applications of elliptic curve cryptography
Proceedings of the 12th Annual Conference on Cyber and Information Security Research, 2017Elliptic curve cryptography (ECC) is a relatively newer form of public key cryptography that provides more security per bit than other forms of cryptography still being used today. We explore the mathematical structure and operations of elliptic curves and how those properties make curves suitable tools for cryptography.
R. Harkanson, Y. Kim
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
International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021), 2022
openaire +2 more sources
openaire +2 more sources