Fields

This section outlines the fields of a public key recognized by R_PKEY.

Defines
#define	R_PKEY_FIELD_ID_RSA_MOD
	Indicates that the data is the modulus (`n`) of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_EXP
	Indicates that the data is the public exponent (`e`) of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_PRIV_EXP
	Indicates that the data is the private exponent (`d`) of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_PRIME_N(n)
	Indicates that the data is the `nth` prime of the RSA key.
#define	R_PKEY_FIELD_ID_RSA_EXP_N(n)
	Indicates that the data is the `nth` exponent calculation of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_INV_N(n)
	Indicates that the data is the `nth` inverse calculation of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_Q
	Indicates that the data is the first prime (`q`) of the RSA key.
#define	R_PKEY_FIELD_ID_RSA_DMQ1
	Indicates that the data is the first exponent calculation of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_P
	Indicates that the data is the second prime (`p`) of the RSA key.
#define	R_PKEY_FIELD_ID_RSA_DMP1
	Indicates that the data is the second exponent calculation of the RSA key. More...
#define	R_PKEY_FIELD_ID_RSA_IQMP
	Indicates that the data is the second inverse calculation of the RSA key. More...
#define	R_PKEY_FIELD_ID_DH_PRIME
	Indicates that the data is the prime parameter of the Diffie-Hellman key. More...
#define	R_PKEY_FIELD_ID_DH_GENERATOR
	Indicates that the data is the public key value of the Diffie-Hellman key. More...
#define	R_PKEY_FIELD_ID_DH_PUB_KEY
	Indicates that the data is the public key value of the Diffie-Hellman key. More...
#define	R_PKEY_FIELD_ID_DSA_PRIME
	Indicates that the data is the prime modulus parameter of the Digital Signature Algorithm (DSA) key. More...
#define	R_PKEY_FIELD_ID_DSA_SUBPRIME
	Indicates that the data is the sub-prime/prime divisor parameter of the Digital Signature Algorithm (DSA) key. More...
#define	R_PKEY_FIELD_ID_DSA_BASE
	Indicates that the data is the base/generator parameter of the Digital Signature Algorithm (DSA) key. More...
#define	R_PKEY_FIELD_ID_DSA_PUB_KEY
	Indicates that the data is the public key value (`y`) of the Digital Signature Algorithm (DSA) key. More...
#define	R_PKEY_FIELD_ID_DSA_PRIV_KEY
	Indicates that the data is the private key value (`x`) of the Digital Signature Algorithm (DSA) key. More...

Define Documentation

#define R_PKEY_FIELD_ID_DH_GENERATOR

Indicates that the data is the public key value of the Diffie-Hellman key. The public key is calculated by raising the generator to a random value mod p (y=g^x mod p).

#define R_PKEY_FIELD_ID_DH_PRIME

Indicates that the data is the prime parameter of the Diffie-Hellman key. The prime value identifies the Galois field (p=jq+1).

#define R_PKEY_FIELD_ID_DH_PUB_KEY

Indicates that the data is the public key value of the Diffie-Hellman key. The public key is calculated by raising the generator to a random value mod p (y=g^x mod p).

#define R_PKEY_FIELD_ID_DSA_BASE

Indicates that the data is the base/generator parameter of the Digital Signature Algorithm (DSA) key. The base/generator is used as the exponential base for DSA calculations (g = h^[(p-1)/q]).

#define R_PKEY_FIELD_ID_DSA_PRIME

Indicates that the data is the prime modulus parameter of the Digital Signature Algorithm (DSA) key. The prime modulus identifier between 2^(L-1) and 2^L for L in the range of 512-1024 and is a multiple of 64.

#define R_PKEY_FIELD_ID_DSA_PRIV_KEY

Indicates that the data is the private key value (x) of the Digital Signature Algorithm (DSA) key. The private key is the exponent to which the base generator is raised to obtain the public key part (y=g^x mod p).

#define R_PKEY_FIELD_ID_DSA_PUB_KEY

Indicates that the data is the public key value (y) of the Digital Signature Algorithm (DSA) key. The public key is the base/generator value raised to the private key part mod p (y=g^x mod p).

#define R_PKEY_FIELD_ID_DSA_SUBPRIME

Indicates that the data is the sub-prime/prime divisor parameter of the Digital Signature Algorithm (DSA) key. The sub-prime is a prime divisor of the prime minus one between 2^159 and 2^160.

#define R_PKEY_FIELD_ID_RSA_DMP1

Indicates that the data is the second exponent calculation of the RSA key. The calculation is the private exponent mod (p-1) and is a pre-calculation used in a Chinese Remainder Theorem implementation of the private key operations.

#define R_PKEY_FIELD_ID_RSA_DMQ1

Indicates that the data is the first exponent calculation of the RSA key. The calculation is the private exponent mod (q-1) and is a pre-calculation used in a Chinese Remainder Theorem implementation of the private key operations.

#define R_PKEY_FIELD_ID_RSA_EXP

Indicates that the data is the public exponent (e) of the RSA key. The public exponent is often 65537 (0x10001) which allows fast exponentiation calculating.

#define R_PKEY_FIELD_ID_RSA_EXP_N ( n )

Indicates that the data is the nth exponent calculation of the RSA key. The calculation is the private exponent mod prime - 1 and is a pre-calculation used in a Chinese Remainder Theorem implementation of the private key operations.

#define R_PKEY_FIELD_ID_RSA_INV_N ( n )

Indicates that the data is the nth inverse calculation of the RSA key. The calculation is the inverse of the previous prime mod this prime (inv(q) mod p) and is a pre-calculation used in a Chinese Remainder Theorem implementation of the private key operations.

#define R_PKEY_FIELD_ID_RSA_IQMP

Indicates that the data is the second inverse calculation of the RSA key. The calculation is the inverse of the previous prime mod this prime (inv(q) mod p) and is a pre-calculation used in a Chinese Remainder Theorem implementation of the private key operations.

#define R_PKEY_FIELD_ID_RSA_MOD

Indicates that the data is the modulus (n) of the RSA key. The modulus is the product of the primes.

#define R_PKEY_FIELD_ID_RSA_PRIV_EXP

Indicates that the data is the private exponent (d) of the RSA key. The private exponent is the inverse of the public exponent (e.d=1 mod (p-1)(q-1)...).

Fields

Defines

Define Documentation