Provide PDF Format
X9 X9.63-2001
- Public Key Cryptography for the Financial Services Industry, Key Agreement and Key Transport Using Elliptic Curve Cryptography
- standard by Accredited Standards Committee X9 Incorporated, 11/20/2001
- Publisher: X9
$88.00$175.00
This American National Standard defines a suite of schemes designed to facilitate the secure establishment of cryptographic data for the keying of symmetrically keyed algorithms (e.g., TDEA). These mechanisms are based on the elliptic curve analogue of the Diffie-Hellman key agreement mechanism (ANSI X9.42). Because the mechanisms are based on the same fundamental mathematics as the Elliptic Curve Digital Signature Algorithm (ECDSA) (ANSI X9.62), additional efficiencies and functionality maybe obtained by combining these and other cryptographic techniques.
This standard specializes ISO/IEC 15946-3 "Cryptographic Techniques Based on Elliptic Curves - Part 3: Key Establishment" for use within the financial services industry. It defines key establishment schemes that employ asymmetric cryptographic techniques. The arithmetic operations involved in the operation of the schemes take place in the algebraic structure of an elliptic curve over a finite field. Both key agreement and key transport schemes are specified. The schemes may be used by two parties to compute shared keying data that may then be used by symmetric schemes to provide cryptographic services, e.g., data confidentiality and data integrity. Supporting mathematical definitions and examples are also provided.
This standard specializes ISO/IEC 15946-3 "Cryptographic Techniques Based on Elliptic Curves - Part 3: Key Establishment" for use within the financial services industry. It defines key establishment schemes that employ asymmetric cryptographic techniques. The arithmetic operations involved in the operation of the schemes take place in the algebraic structure of an elliptic curve over a finite field. Both key agreement and key transport schemes are specified. The schemes may be used by two parties to compute shared keying data that may then be used by symmetric schemes to provide cryptographic services, e.g., data confidentiality and data integrity. Supporting mathematical definitions and examples are also provided.