IEEE DRAFT 1363 : D13 99

1 Overview
    1.1 Scope
    1.2 Purpose
    1.3 Organization of the document
2 References
3 Definitions
4 Types of cryptographic techniques
    4.1 General model
    4.2 Primitives
    4.3 Schemes
    4.4 Additional methods
    4.5 Table summary
5 Mathematical conventions
    5.1 Mathematical notation
    5.2 Bit strings and octet strings
    5.3 Finite fields
    5.4 Elliptic curves and points
    5.5 Data type conversion
6 Primitives based on the discrete logarithm problem
    6.1 The DL setting
    6.2 Primitives
7 Primitives based on the elliptic curve discrete
    logarithm problem
    7.1 The EC setting
    7.2 Primitives
8 Primitives based on the integer factorization problem
    8.1 The IF setting
    8.2 Primitives
9 Key agreement schemes
    9.1 General model
    9.2 DL/ECKAS-DH1
    9.3 DL/ECKAS-DH2
    9.4 DL/ECKAS-MQV
10 Signature schemes
    10.1 General model
    10.2 DL/ECSSA
    10.3 IFSSA
11 Encryption schemes
    11.1 General model
    11.2 IFES
12 Message encoding methods
    12.1 Message encoding methods for signatures with
          appendix
    12.2 Message encoding methods for encryption
13 Key derivation functions
    13.1 KDF1
14 Auxiliary functions
    14.1 Hash-functions
    14.2 Mask generation functions
Annex A (informative) Number-theoretic background
Annex B (normative) Conformance
Annex C (informative) Rationale
Annex D (informative) Security considerations
Annex E (informative) Formats
Annex F (informative) Bibliography

Specifies common public-key cryptographic techniques, including mathematical primitives for secret value (key) derivation, public-key encryption, and digital signatures, and cryptographic schemes based on those primitives. Transition from paper to electronic media brings with it the need for electronic privacy, public-key cryptography techniques offer fundamental technology to meet this need.