IEEE 1363a-2004

$62.83

IEEE Standard Specifications for Public-Key Cryptography – Amendment 1: Additional Techniques

Published By	Publication Date	Number of Pages
IEEE	2004

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

Amendment Standard – Inactive-Reserved. Amendment to IEEE Std 1363-2000, this standard specifies additional public-key cryptographic techniques beyond those in IEEE Std 1363-2000. It is intended to be merged with IEEE Std 1363-2000 during future revisions.

PDF Catalog

PDF Pages	PDF Title
2	Title Page
4	Introduction
5	Notice to users Errata Interpretations Patents Organization
6	Participants
8	CONTENTS
10	Editor’s Note
11	1. Overview 1.1 Scope 1.2 Purpose 2. References
12	3. Definitions
13	4. Types of cryptographic techniques 4.2 Primitives 4.3 Schemes 4.4 Additional methods
14	4.5 Table summary
16	5. Mathematical conventions 5.1 Mathematical notation
18	5.4 Elliptic curves and points 5.5 Data type conversion
24	6. Primitives based on the discrete logarithm problem 6.2 Primitives
30	7. Primitives based on the elliptic curve discrete logarithm problem 7.2 Primitives
35	8. Primitives based on the integer factorization problem
37	8.2 Primitives
42	9. Key agreement schemes 9.2 DL/ECKAS-DH1
43	9.3 DL/ECKAS-DH2
44	9.4 DL/ECKAS-MQV
45	10. Signature schemes 10.1 General model
47	10.2 DL/ECSSA
48	10.3 IFSSA
50	10.4 DL/ECSSR
52	10.5 DL/ECSSR-PV
55	10.6 IFSSR
57	11. Encryption schemes 11.1 General model
59	11.2 IFES 11.3 DL/ECIES
64	11.4 IFES-EPOC
66	12. Message-encoding methods 12.1 Message-encoding methods for signatures with appendix
73	12.2 Message-encoding methods for encryption
80	12.3 Message-encoding methods for signatures giving message recovery
86	13. Key derivation functions
87	13.2 KDF2
88	14. Auxiliary techniques 14.1 Hash functions
91	14.2 Mask generation functions
92	14.3 Symmetric encryption schemes
96	14.4 Message authentication codes
98	Annex A (informative) Number-theoretic algorithms A.2 Integer and modular arithmetic: algorithms
99	A.3 Binary finite fields: overview
100	A.7 Basis conversion for binary fields
110	A.17 Odd-characteristic extension fields
120	Annex B (normative) Conformance B.2 Conformance requirements
123	Annex C (informative) Rationale
124	C.3 Schemes
126	C.4 Additional methods
128	Annex D (informative) Security considerations D.1 Introduction
129	D.4 Family-specific considerations
156	Annex E (informative) Formats E.1 Overview E.2 Representing basic data types as octet strings
158	E.3 Representing outputs of schemes as octet strings
160	Annex F (informative) Information about patents
161	Annex G (informative) Bibliography