IEEE 1363.3-2013 PDF
This document specifies identity-based cryptographic schemes based on the bilinear mappings over elliptic curves known as pairings. Specific techniques include algorithms to compute the pairings and specification of recommended elliptic curves and curve parameters over which the pairings are defined. The class of computer and communications systems is not restricted.
The proliferation of electronic communication and the Internet brings with it the need for privacy and data protection. Public-key cryptography offers fundamental technology addressing this need. Many alternative public-key techniques have been proposed, each with its own benefits. IEEE Std 1363TM-20001 and IEEE Std 1363a(TM)-2004 have produced a comprehensive reference defining a range of common public-key techniques covering key agreement, public-key encryption, and digital signatures from several families, namely the discrete logarithm, integer factorization, and elliptic curve families. This document will specify identity-based cryptographic techniques based on pairings. These offer advantages over classic public-key techniques specified in IEEE Std 1363-2000. Examples are the lack of a requirement to exchange or look up public keys of a recipient and the simplified use of short-lived keys. The class of computer and communications systems is not restricted.
New IEEE Standard – Inactive-Reserved. Common identity-based public-key cryptographic techniques that use pairings, including mathematical primitives for secret value (key) derivation, public-key encryption, and digital signatures, as well as cryptographic schemes based on those primitives are specified in this standard. Also, related cryptographic parameters, public keys and private keys, are specified. The purpose of this standard is to provide a reference for specifications of a variety of techniques from which applications may select.
