Elliptic curves (ECC) are a plane algebraic curve with the form:
![\[y^2=x^3+ax+b \]](https://sp-ao.shortpixel.ai/client/to_webp,q_glossy,ret_img,w_130,h_21/http://dprogrammer.org/wp-content/ql-cache/quicklatex.com-43f7b049f5dacdcddcac5053ea7e3b6c_l3.png "Rendered by QuickLaTeX.com")
General definition
![\[y^2=x^3-px-q\]](https://sp-ao.shortpixel.ai/client/to_webp,q_glossy,ret_img,w_129,h_21/http://dprogrammer.org/wp-content/ql-cache/quicklatex.com-e088e389443ba4473aae1c547414e029_l3.png "Rendered by QuickLaTeX.com")
where 
and 
are elements such that 
does not have double root.
Elliptic Curve Algorithm (ECC)
ECC operations and performance
Category: Cryptography
RSA Algorithm
RSA encryption and decryption algorithm and implementation in C++
RSA is an algorithm used by modern computers to encrypt and decrypt messages. Modern encryption is mostly based on this algorithm.
It is an asymmetric cryptographic algorithm.
Asymmetric means that there are two different keys. This is also called public key cryptography because one of the keys can be given to anyone. The other key must be kept private, Elliptic curve algorithm uses asymmetric cryptography also.
The algorithm is based on the fact that finding the factors of a large composite number is difficult: when the integers are prime numbers, the problem is called prime factorization. It is also a key pair (public and private key) generator.
Modern Cryptography
Cryptography introduction and different fields
Ancestors had the necessity to transmit information that could not be shared with the rest of the people, although messages may be intercepted and that was the beginnings of cryptography.
Encryption: conversion of information from a readable state to apparent nonsense.
The cryptography literature often uses the names Alice and Bob, who want to transmit information that could not be translated even being intercepted by a third party, Eve.