Contents 1 Introduction 1.1 Background 1.2 Elliptic curve cryptosystems 1.3 Why have a challenge? 2 The Elliptic Curve Discrete Logarithm Problem (ECDLP) 2.1 The discrete logarithm problem 2.2 Algorithms known for the ECDLP 2.3 Is there a subexponential-time algorithm for ECDLP? 3 The Challenge Explained 3.1 Elliptic curves over F2m - format and examples 3.1.1 The finite field F2m 3.1.2 Elliptic curves over F2m 3.1.3 Format for challenge parameters (the F2m case) 3.1.4 Random elliptic curves and points (the F2m case) 3.2 Elliptic curves over Fp - format and examples 3.2.1 The finite field Fp 3.2.2 Elliptic curves over Fp 3.2.3 Format for challenge parameters (the Fp case) 3.2.4 Random elliptic curves and points (the Fp case) 3.3 Further details about the challenge 4 Exercise Lists and Challenge Lists 4.1 Elliptic curves over F2m 4.1.1 Exercises 4.1.2 Level I challenges 4.1.3 Level II challenges 4.2 Elliptic curves over Fp 4.2.1 Exercises 4.2.2 Level I challenges 4.2.3 Level II challenges 5 The Certicom ECC Challenge Rules 5.1 The Rules and Reporting a Solution 5.1.1 Format of Submissions 5.2 Prizes and Status 5.2.1 Exercise Prize Lists 5.2.2 Level I Challenge Prize List 5.2.3 Level II Challenge Prize List 5.2.4 Administration and Collection of Prizes 6 Status of the Challenge 6.1 Solution Details 6.2 Time estimates for the open problems References

Copyright © Certicom Corp., 1997-2000. All rights reserved. Information subject to change. http://www.certicom.com