Text
Handbook of elliptic and hiperellectic curve cryptography
1. Introduction to Public-Key Cryptography
Mathematical Background
2. Algebraic Background
3. Background on p-adic Numbers
4. Background on Curves and Jacobians
5. Varieties Over Special Fields
6. Background on Pairings
7. Background on Weil Descent
8. Cohomological Background on Point Counting
Elementary Arithmetic
9. Exponentiation
10. Integer Arithmetic
11. Finite Field Arithmetic
12. Arithmetic of p-adic Numbers
Arithmetic of Curves
13. Arithmetic of Elliptic Curves
14. Arithmetic of Hyperelliptic Curves
15. Arithmetic of Special Curves
16. Implementation of Pairings
Point Counting
17. Point Counting on Elliptic and Hyperelliptic Curves
18. Complex Multiplication
Computation of Discrete Logarithms
19. Generic Algorithms for Computing Discrete Logarithms
20. Index Calculus
21. Index Calculus for Hyperelliptic Curves
22. Transfer of Discrete Logarithms
Applications
23. Algebraic Realizations of DL Systems
24. Pairing-Based Cryptography
25. Compositeness and Primality Testing-Factoring
Realizations of DL Systems
26. Fast Arithmetic Hardware
27. Smart Cards
28. Practical Attacks on Smart Cards
29. Mathematical Countermeasures Against Side-Channel Attacks
30. Random Numbers
No other version available