Visible to Intel only — GUID: GUID-0973CC7A-FB42-4A92-9CF3-8E9D2F42A0C0
Visible to Intel only — GUID: GUID-0973CC7A-FB42-4A92-9CF3-8E9D2F42A0C0
Functions Based on GF(p)
This section describes functions designed to specify the elliptic curve cryptosystem and perform various operations on the elliptic curve defined over a prime finite field. The examples of the operations are shown below:
Setting up operations: GFpECSet sets up elliptic curve domain parameters.
Computation operations: GFpECAddPoint computes the sum of two points on an elliptic curve. GFpECMulPoint performs the scalar multiplication of a point on the elliptic curve. GFpECSignDSA computes the digital signature of a message.
Validation operations: GFpECVerify checks validity of the elliptic curve domain parameters. GFpECTstKeyPair validates correctness of the public and private keys.
Generation operations: GFpECPrivateKey, GFpECPublicKey generates a private key and computes a public key for the given elliptic cryptosystem.
Retrieval operations: GFpECGet retrieves elliptic curve domain parameters. GFpECGetSubgroup retrieves the size of a base point in bytes.
All functions described in this section employ a context IppsGFpState that catches several auxiliary components specifying operations performed on the elliptic curve or entire elliptic cryptosystem. ECCP stands for Elliptic Curve Cryptography Prime and means that all functions whose name include this abbreviation perform operations over a prime finite field GF( p).
Important
To provide minimum security of the elliptic curve cryptosystem over a prime finite field, the length of the underlying prime must be equal to or greater than 160 bits.