IEEE 1363.1:2008 pdf free download – IEEE Standard Specification for PublicKey Cryptographic Techniques Basedon Hard Problems over Lattices
3.1.94statistically unique: For the generation of n-bit quantities, the probability of two values repeating is less than or equal to the probability of two n-bit random quantities repeating. More formally, anelement chosen from a finite set S of n elements is said to be statistically unique if the process thatgoverns the selection of this element is such that, for any integer L ≤n, the probability that all ofthe first L selected elements are different is no smaller than the probability of this happening whenthe elements are drawn uniformly randomly from S.
3.1.95 symmetric cryptographic algorithm: A cryptographic algorithm that uses one cryptographickey. Anyone who knows the key can both encrypt and decrypt a message, and can calculate aMessage Authentication Code using that key.
3.1.96symmetric cryptography: Methods that allow parties to communicate securely only when they already share some prior secrets, such as the secret key.Contrast: public key cryptography. Seealso: secret key.
3.1.97symmetric key: A cryptographic key that is used in symmetric cryptographic algorithms. The same symmetric key that is used for encryption is also used for decryption.
3.1.98user: A party that uses a public key.
3.1.99valid domain parameters: A set of domain parameters that satisfies the specific mathematical definition for the set of domain parameters of its family. While a set of mathematical objects mayhave the general structure of a set of domain parameters, it may not actually satisfy the definition(for example，it may be internally inconsistent) and thus not be valid. See also: domainparameters; public/private key pair; valid key; valid key pair; validation.
3.1.100 valid key: A key (public or private) that satisfies the specific mathematical definition for the keys of its family, possibly in the context of its set of domain parameters.While some mathematicalobjects may have the general structure of keys, they may not actually lie in the appropriate set (forexample, they may not lie in the appropriate subgroup of a group or be out of the bounds allowedby the domain parameters) and thus not be valid keys. See also: domain parameters;public/private key pair; valid domain parameters; valid key pair; validation.
3.1.101 valid key pair: A public/private key pair that satisfies the specific mathematical definition for the key pairs of its family, possibly in the context of its set of domain parameters.While a pair ofmathematical objects may have the general structure of a key pair, the keys may not actually lie inthe appropriate sets (for example, they may not lie in the appropriate subgroup of a group or be outof the bounds allowed by the domain parameters) or may not correspond to each other; such a pairis thus not a valid key pair. See also: domain parameters; public/private key pair;validdomain parameters; valid key; validation.
3.1.102 validation: See: domain parameter validation; key validation.
3.1.103 verify: In relation to a Digital Signature means to determine accurately: (1) that the Digital Signature was created during the operational period of a valid Certificate by the private keycorresponding to the public key listed in the Certificate; and (2) the message has not been alteredsince its Digital Signature was created.