{"id":396404,"date":"2024-10-20T04:24:29","date_gmt":"2024-10-20T04:24:29","guid":{"rendered":"https:\/\/pdfstandards.shop\/product\/uncategorized\/ieee-1363a-2004-2\/"},"modified":"2024-10-26T08:11:52","modified_gmt":"2024-10-26T08:11:52","slug":"ieee-1363a-2004-2","status":"publish","type":"product","link":"https:\/\/pdfstandards.shop\/product\/publishers\/ieee\/ieee-1363a-2004-2\/","title":{"rendered":"IEEE 1363a-2004"},"content":{"rendered":"
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.<\/p>\n
PDF Pages<\/th>\n | PDF Title<\/th>\n<\/tr>\n | ||||||
---|---|---|---|---|---|---|---|
2<\/td>\n | Title Page <\/td>\n<\/tr>\n | ||||||
4<\/td>\n | Introduction <\/td>\n<\/tr>\n | ||||||
5<\/td>\n | Notice to users Errata Interpretations Patents Organization <\/td>\n<\/tr>\n | ||||||
6<\/td>\n | Participants <\/td>\n<\/tr>\n | ||||||
8<\/td>\n | CONTENTS <\/td>\n<\/tr>\n | ||||||
10<\/td>\n | Editor’s Note <\/td>\n<\/tr>\n | ||||||
11<\/td>\n | 1. Overview 1.1 Scope 1.2 Purpose 2. References <\/td>\n<\/tr>\n | ||||||
12<\/td>\n | 3. Definitions <\/td>\n<\/tr>\n | ||||||
13<\/td>\n | 4. Types of cryptographic techniques 4.2 Primitives 4.3 Schemes 4.4 Additional methods <\/td>\n<\/tr>\n | ||||||
14<\/td>\n | 4.5 Table summary <\/td>\n<\/tr>\n | ||||||
16<\/td>\n | 5. Mathematical conventions 5.1 Mathematical notation <\/td>\n<\/tr>\n | ||||||
18<\/td>\n | 5.4 Elliptic curves and points 5.5 Data type conversion <\/td>\n<\/tr>\n | ||||||
24<\/td>\n | 6. Primitives based on the discrete logarithm problem 6.2 Primitives <\/td>\n<\/tr>\n | ||||||
30<\/td>\n | 7. Primitives based on the elliptic curve discrete logarithm problem 7.2 Primitives <\/td>\n<\/tr>\n | ||||||
35<\/td>\n | 8. Primitives based on the integer factorization problem <\/td>\n<\/tr>\n | ||||||
37<\/td>\n | 8.2 Primitives <\/td>\n<\/tr>\n | ||||||
42<\/td>\n | 9. Key agreement schemes 9.2 DL\/ECKAS-DH1 <\/td>\n<\/tr>\n | ||||||
43<\/td>\n | 9.3 DL\/ECKAS-DH2 <\/td>\n<\/tr>\n | ||||||
44<\/td>\n | 9.4 DL\/ECKAS-MQV <\/td>\n<\/tr>\n | ||||||
45<\/td>\n | 10. Signature schemes 10.1 General model <\/td>\n<\/tr>\n | ||||||
47<\/td>\n | 10.2 DL\/ECSSA <\/td>\n<\/tr>\n | ||||||
48<\/td>\n | 10.3 IFSSA <\/td>\n<\/tr>\n | ||||||
50<\/td>\n | 10.4 DL\/ECSSR <\/td>\n<\/tr>\n | ||||||
52<\/td>\n | 10.5 DL\/ECSSR-PV <\/td>\n<\/tr>\n | ||||||
55<\/td>\n | 10.6 IFSSR <\/td>\n<\/tr>\n | ||||||
57<\/td>\n | 11. Encryption schemes 11.1 General model <\/td>\n<\/tr>\n | ||||||
59<\/td>\n | 11.2 IFES 11.3 DL\/ECIES <\/td>\n<\/tr>\n | ||||||
64<\/td>\n | 11.4 IFES-EPOC <\/td>\n<\/tr>\n | ||||||
66<\/td>\n | 12. Message-encoding methods 12.1 Message-encoding methods for signatures with appendix <\/td>\n<\/tr>\n | ||||||
73<\/td>\n | 12.2 Message-encoding methods for encryption <\/td>\n<\/tr>\n | ||||||
80<\/td>\n | 12.3 Message-encoding methods for signatures giving message recovery <\/td>\n<\/tr>\n | ||||||
86<\/td>\n | 13. Key derivation functions <\/td>\n<\/tr>\n | ||||||
87<\/td>\n | 13.2 KDF2 <\/td>\n<\/tr>\n | ||||||
88<\/td>\n | 14. Auxiliary techniques 14.1 Hash functions <\/td>\n<\/tr>\n | ||||||
91<\/td>\n | 14.2 Mask generation functions <\/td>\n<\/tr>\n | ||||||
92<\/td>\n | 14.3 Symmetric encryption schemes <\/td>\n<\/tr>\n | ||||||
96<\/td>\n | 14.4 Message authentication codes <\/td>\n<\/tr>\n | ||||||
98<\/td>\n | Annex A (informative) Number-theoretic algorithms A.2 Integer and modular arithmetic: algorithms <\/td>\n<\/tr>\n | ||||||
99<\/td>\n | A.3 Binary finite fields: overview <\/td>\n<\/tr>\n | ||||||
100<\/td>\n | A.7 Basis conversion for binary fields <\/td>\n<\/tr>\n | ||||||
110<\/td>\n | A.17 Odd-characteristic extension fields <\/td>\n<\/tr>\n | ||||||
120<\/td>\n | Annex B (normative) Conformance B.2 Conformance requirements <\/td>\n<\/tr>\n | ||||||
123<\/td>\n | Annex C (informative) Rationale <\/td>\n<\/tr>\n | ||||||
124<\/td>\n | C.3 Schemes <\/td>\n<\/tr>\n | ||||||
126<\/td>\n | C.4 Additional methods <\/td>\n<\/tr>\n | ||||||
128<\/td>\n | Annex D (informative) Security considerations D.1 Introduction <\/td>\n<\/tr>\n | ||||||
129<\/td>\n | D.4 Family-specific considerations <\/td>\n<\/tr>\n | ||||||
156<\/td>\n | Annex E (informative) Formats E.1 Overview E.2 Representing basic data types as octet strings <\/td>\n<\/tr>\n | ||||||
158<\/td>\n | E.3 Representing outputs of schemes as octet strings <\/td>\n<\/tr>\n | ||||||
160<\/td>\n | Annex F (informative) Information about patents <\/td>\n<\/tr>\n | ||||||
161<\/td>\n | Annex G (informative) Bibliography <\/td>\n<\/tr>\n<\/table>\n","protected":false},"excerpt":{"rendered":" IEEE Standard Specifications for Public-Key Cryptography – Amendment 1: Additional Techniques<\/b><\/p>\n |