American National Standards Institute eStandards Store Home page Shopping Cart Alert me My account Download Frequently asked questions Terms Of Use Help
ANSI Standards Store ANSI Standards Store
AAMI - Medical Device Standards SIA - Scaffold Standards NEMA - Electrical Standards BSI - British Standards Institution ASTM International Standards DIN - German Institute for Standardization ISO Environmental Management Standards
Browse Standards

Browse ISO Standards
Browse IEC Standards

View all publishers

 
 

View All Standards Packages

Bookmark and Share
 
ANSI Blog    Follow ANSI on Twitter    Follow ANSI on Youtube
Follow ANSI on LinkedIn    Follow ANSI on Google Plus    Follow ANSI on Facebook
Get Adobe Acrobat Reader
Get File Open Plug-In
 
 Document Number  Keyword   News  
Search Tips
 


ANSI X9.42:2003

     

Public Key Cryptography for the Financial Services Industry: Agreement of Symmetric Keys Using Discrete Logarithm Cryptography

This standard, specifies schemes for the agreement of symmetric keys using Diffie-Hellman and MQV algorithms. It covers methods of domain parameter generation, domain parameter validation, key pair generation, public key validation, shared secret value calculation, key derivation, and test message authentication code computation for discrete logarithm problem based key agreement schemes. These methods may be used by different parties to establish a piece of common shared secret information such as cryptographic keys. The shared secret information may be used with symmetrically-keyed algorithms to provide confidentiality, authentication, and data integrity services for financial information, or used as a key-encrypting key with other ASC X9 key management protocols.
#
Price: $100.00
File Size: 371 KB 
Learn more about Site Licenses


Would you like to Email to a friend? If you would like to Email a friend a link to this item please Login Questions?

  Find
 
GlobalSpec - The Engineering Search Engine

 

ANSI Copyright
eStandards Store home page Cart Alert Account Download Frequently Asked Questions Privacy Policy Contact Us Help