For the point P (11, 2) defined in the curve E13(1, 1). What is –P?

🎲 Try a Random Question  |  Total Questions in Quiz: 16  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Cryptography Practice Test: Elliptic Curve Arithmetic/Cryptography — practice the complete quiz, review flashcards, or try a random question.

Elliptic curve cryptography (ECC) is a public key encryption technique that uses elliptic curves to create cryptographic keys. ECC is considered one of the most powerful types of cryptography in use today. 

ECC is based on the assumption that it is difficult to find the discrete logarithm of a random number. ECC uses modular arithmetic and group theory to deal with elliptic curves over finite fields. A finite field is a set of a certain number of numbers, which also includes infinity. 
 


For the point P (11, 2) defined in the curve E13(1, 1). What is –P?