Preface |
|
ix | |
Abbreviations and Standard Notation |
|
xi | |
Authors |
|
xv | |
|
|
|
Elliptic Curve Based Protocols |
|
|
3 | (18) |
|
|
|
3 | (1) |
|
|
4 | (4) |
|
|
8 | (4) |
|
|
12 | (6) |
|
|
18 | (3) |
|
On the Provable Security of ECDSA |
|
|
21 | (20) |
|
|
|
21 | (2) |
|
Definitions and Conditions |
|
|
23 | (9) |
|
Provable Security Results |
|
|
32 | (1) |
|
|
33 | (3) |
|
|
36 | (5) |
|
Proofs of Security for ECIES |
|
|
41 | (28) |
|
|
Definitions and Preliminaries |
|
|
42 | (8) |
|
Security Proofs for ECIES |
|
|
50 | (8) |
|
Other Attacks Against ECIES |
|
|
58 | (3) |
|
|
61 | (8) |
|
Part 2. Implementation Techniques |
|
|
|
|
69 | (18) |
|
|
|
70 | (1) |
|
|
71 | (1) |
|
|
72 | (5) |
|
Simple SCA Attacks on Point Multiplications |
|
|
77 | (7) |
|
Differential SCA Attacks on Point Multiplications |
|
|
84 | (3) |
|
Defences Against Side-Channel Analysis |
|
|
87 | (16) |
|
|
|
87 | (1) |
|
Indistinguishable Point Addition Formula |
|
|
88 | (5) |
|
Regular Point Multiplication Algorithms |
|
|
93 | (4) |
|
Base-Point Randomization Techniques |
|
|
97 | (1) |
|
Multiplier Randomization Techniques |
|
|
98 | (2) |
|
Preventing Side-Channel Analysis |
|
|
100 | (3) |
|
Part 3. Mathematical Foundations |
|
|
|
Advances in Point Counting |
|
|
103 | (30) |
|
|
p-adic Fields and Extensions |
|
|
104 | (1) |
|
|
105 | (10) |
|
Arithmetic Geometric Mean |
|
|
115 | (6) |
|
Generalized Newton Iteration |
|
|
121 | (7) |
|
|
128 | (4) |
|
|
132 | (1) |
|
Hyperelliptic Curves and the HCDLP |
|
|
133 | (18) |
|
|
Generalities on Hyperelliptic Curves |
|
|
133 | (3) |
|
Algorithms for Computing the Group Law |
|
|
136 | (4) |
|
Classical Algorithms for HCDLP |
|
|
140 | (2) |
|
|
142 | (2) |
|
Index-Calculus Algorithm for Hyperelliptic Curves |
|
|
144 | (2) |
|
|
146 | (3) |
|
|
149 | (2) |
|
|
151 | (32) |
|
|
Introduction -- the Weil Descent Methodology |
|
|
151 | (2) |
|
|
153 | (13) |
|
Extending the GHS Attack Using Isogenies |
|
|
166 | (7) |
|
Summary of Practical Implications |
|
|
173 | (2) |
|
|
175 | (8) |
|
Part 4. Pairing Based Techniques |
|
|
|
|
183 | (32) |
|
|
|
183 | (1) |
|
Divisors and Weil Reciprocity |
|
|
184 | (1) |
|
Definition of the Tate Pairing |
|
|
185 | (2) |
|
Properties of the Tate Pairing |
|
|
187 | (2) |
|
The Tate Pairing over Finite Fields |
|
|
189 | (2) |
|
|
191 | (1) |
|
Non-degeneracy, Self-pairings and Distortion Maps |
|
|
192 | (4) |
|
Computing the Tate Pairing Using Miller's Algorithm |
|
|
196 | (1) |
|
The MOV/Frey--Ruck Attack on the ECDLP |
|
|
197 | (1) |
|
Supersingular Elliptic Curves |
|
|
198 | (3) |
|
Applications and Computational Problems from Pairings |
|
|
201 | (2) |
|
Parameter Sizes and Implementation Considerations |
|
|
203 | (1) |
|
Suitable Supersingular Elliptic Curves |
|
|
204 | (1) |
|
Efficient Computation of the Tate Pairing |
|
|
205 | (3) |
|
|
208 | (7) |
|
Appendix: Proof of Weil Reciprocity |
|
|
212 | (3) |
|
Cryptography from Pairings |
|
|
215 | (38) |
|
|
|
215 | (3) |
|
|
218 | (3) |
|
Identity-Based Encryption |
|
|
221 | (7) |
|
|
228 | (7) |
|
Hierarchical Identity-Based Cryptography and Related Topics |
|
|
235 | (5) |
|
More Key Agreement Protocols |
|
|
240 | (2) |
|
Applications and Infrastructures |
|
|
242 | (8) |
|
|
250 | (3) |
|
|
253 | (20) |
|
Summary of Major LNCS Proceedings |
|
|
271 | (2) |
Author Index |
|
273 | (4) |
Subject Index |
|
277 | |