IEEE 1363-2000

$117.54

IEEE Standard Specifications for Public-Key Cryptography

Published By	Publication Date	Number of Pages
IEEE	2000

Guaranteed Safe Checkout

Category: IEEE

If you have any questions, feel free to reach out to our online customer service team by clicking on the bottom right corner. We’re here to assist you 24/7.
Email:[email protected]

Description

New IEEE Standard – Inactive-Reserved. This standard 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. It also specifies related cryptographic parameters, public keys, and private keys. The purpose of this standard is to provide a reference for specifications on a variety of techniques from which applications may select.

PDF Catalog

PDF Pages	PDF Title
1	Title page
3	Introduction
4	Participants
6	CONTENTS
9	1. Overview 1.1 Scope 1.2 Purpose
10	1.3 Organization of the document 2. References
11	3. Definitions
15	4. Types of cryptographic techniques 4.1 General model
16	4.2 Primitives 4.3 Schemes
17	4.4 Additional methods 4.5 Table summary
18	5. Mathematical conventions
19	5.1 Mathematical notation
20	5.2 Bit strings and octet strings
21	5.3 Finite fields
22	5.4 Elliptic curves and points 5.5 Data type conversion
25	6. Primitives based on the discrete logarithm problem 6.1 The DL setting
27	6.2 Primitives
35	7. Primitives based on the elliptic curve discrete logarithm problem 7.1 The EC setting
37	7.2 Primitives
45	8. Primitives based on the integer factorization problem 8.1 The IF setting
47	8.2 Primitives
54	9. Key agreement schemes 9.1 General model
55	9.2 DL/ECKAS-DH1
57	9.3 DL/ECKAS-DH2
58	9.4 DL/ECKAS-MQV
59	10. Signature schemes 10.1 General model
61	10.2 DL/ECSSA
63	10.3 IFSSA
64	11. Encryption schemes 11.1 General model
65	11.2 IFES
66	12. Message-encoding methods
67	12.1 Message-encoding methods for signatures with appendix
69	12.2 Message-encoding methods for encryption
71	13. Key derivation functions
72	13.1 KDF1 14. Auxiliary functions 14.1 Hash functions
73	14.2 Mask generation functions
75	Annex A—Number-theoretic background A.1 Integer and modular arithmetic: overview
80	A.2 Integer and modular arithmetic: algorithms
85	A.3 Binary finite fields: overview
93	A.4 Binary finite fields: algorithms
99	A.5 Polynomials over a finite field
102	A.6 General normal bases for binary fields
106	A.7 Basis conversion for binary fields
112	A.8 Bases for binary fields: tables and algorithms
123	A.9 Elliptic curves: overview
129	A.10 Elliptic curves: algorithms
139	A.11 Functions for elliptic curve parameter and key generation
142	A.12 Functions for elliptic curve parameter and key validation
151	A.13 Class group calculations
155	A.14 Complex multiplication
165	A.15 Primality tests and proofs
170	A.16 Generation and validation of parameters and keys
178	Annex B—Conformance B.1 General model
179	B.2 Conformance requirements
181	B.3 Examples
185	Annex C—Rationale C.1 General
186	C.2 Keys and domain parameters
187	C.3 Schemes
190	Annex D—Security considerations D.1 Introduction D.2 General principles
192	D.3 Key management considerations
196	D.4 Family-specific considerations
206	D.5 Scheme-specific considerations
216	D.6 Random number generation
220	D.7 Implementation considerations
221	Annex E—Formats E.1 Overview E.2 Representing basic data types as octet strings
224	E.3 Representing outputs of schemes as octet strings
225	Annex F—Bibliography