- Three families of cryptographic functions, according to the
underlying computationally difficult problem:
- discrete logarithm in the group of remainders modulo a prime (DL)
- discrete logarithm in the group of points on an elliptic curve over a finite field (EC)
- integer factorization (IF)

- For the DL family, the standard will include the following
algorithms:
- Diffie-Hellman key agreement allowing up to two key pairs from each party
- Menezes-Qu-Vanstone key agreement, which requires two key pairs from each party
- DSA Signatures, with SHA-1 and RIPEMD-160 as hash functions
- Nyberg-Rueppel Signatures with appendix, with SHA-1 and RIPEMD-160 as hash functions

- For the EC family, the standard will mirror the DL family; the only significant difference is the change in the underlying group
- For the IF family, the standard will include the following
algorithms:
- RSA encryption with Optimal Asymmetric Encryption Padding (OAEP)
- RSA signature with appendix using a hash function and ANSI X9.31 padding of the hash value
- Rabin-Williams (even exponent) equivalents of the above RSA signatures

- A number of annexes, describing the following:
- Mathematical and cryptographic background as well as number-theoretic algorithms of use in implementing the standard
- What it means to comply with the standard
- Rationale for the decisions made in the standard
- Security considerations for algorithms in the stadnard
- Suggested formats for mathematical objects and algorithm outputs
- Bibliography

IEEE Home Page | IEEE Standards | P1363 Home Page |