Criptografia com Curvas Elípticas
It addresses the need for more secure encryption methods in cryptography, but it is incremental as it reviews existing concepts without introducing new techniques.
This paper provides an overview of elliptic curve cryptography, tackling the problem of secure encryption by leveraging the discrete logarithm problem, which is noted to be significantly harder than in other cryptosystems like Diffie-Hellman and RSA, though no concrete numerical results are presented.
This paper presents an overview of the use of elliptic curves in cryptography. The security of this cryptosystem is based on the discrete logarithm problem, which appears to be much harder compared to the discrete logarithm problem in other cryptosystems. An overview of common cryptosystems is given, such as Diffie-Hellman and RSA, and an elliptic curve cryptography scheme is discussed. -------- Este trabalho apresenta o uso das curvas elípticas em criptografia. Sua segurança está baseada no problema do logaritmo discreto. Este problema aparentemente é significativamente mais difícil de resolver, comparado com o problema do logaritmo discreto usado por outros sistemas de criptografia. É dada uma visão geral de sistemas de criptografia comuns, como Diffie-Hellman e RSA, e discute-se um esquema de criptografia usando curvas elípticas.