Elliptic Curve Cryptography Tutorial1 Arithmetic Primitives 1.1 Modular Arithmetic Primer One way to do arithmetic calculations is to perform them inside a finite field over a prime number, or Fp. This means that every operation within the basic arithmetic works modulo a chosen prime number. The reason for choosing a prime is that this way, the field has important properties (such as algebraic closure and the invertability of each i
{{#tags}}- {{label}}
{{/tags}}