Mathematical routines for the NIST prime elliptic curves

Abstract: Described in this document are routines for implementing primitives for elliptic curve cryptography on the NIST elliptic curves P–192, P–224, P–256, P–384, and P–521 given in [FIPS186-2]. Also included are specialized routines for field arithmetic over the relevant prime fields and example calculations.

Date Published:

Last Reviewed: 16 July 2015

Dissemination Control: N/A

Length: 44 page(s)

Format: pdf

Type: Reference/Overview

Tags: Elliptic Curve Digital Signature Algorithm - ECDSA; National Institute of Standards and Technology - NIST; Data Protection; Algorithm; Commercial National Security Algorithm Suite - CNSA Suite; Encryption; Cryptography (Crypto); Adobe