Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Advances in Elliptic Curve Cryptography

$84.99

Part of London Mathematical Society Lecture Note Series

N. P. Smart, D. Brown, A. W. Dent, E. Oswald, M. Joye, F. Vercauteren, P. Gaudry, F. Hess, S. Galbraith, K. G. Paterson
View all contributors
  • Date Published: April 2005
  • availability: Available
  • format: Paperback
  • isbn: 9780521604154

$84.99
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics. They are divided into the areas of protocols, implementation techniques, mathematical foundations and pairing based cryptography. Each of the topics is presented in an accessible, coherent and consistent manner for a wide audience that will include mathematicians, computer scientists and engineers.

    • Provides an up-to-date treatment of critical topics in cryptography
    • The chapters are written by the leading international experts in each area
    • The topics are made accessible for the first time outside of research journals
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2005
    • format: Paperback
    • isbn: 9780521604154
    • length: 298 pages
    • dimensions: 229 x 152 x 17 mm
    • weight: 0.44kg
    • contains: 7 b/w illus. 11 tables
    • availability: Available
  • Table of Contents

    Part I. Protocols:
    1. Elliptic curve base protocols N. P. Smart
    2. On the provable security of ECDSA D. Brown
    3. Proofs of security for ECIES A. W. Dent
    Part II. Implementation Techniques:
    4. Side channel analysis E. Oswald
    5. Defenses against side-channel analysis M. Joye
    Part III. Mathematical Foundations:
    6. Advances in point counting F. Vercauteren
    7. Hyperelliptic curves and the HCDLP P. Guadry
    8. Weil descent attacks F. Hess
    Part IV. Pairing Based Techniques:
    9. Pairings S. Galbraith
    10. Cryptography from pairings K. G. Paterson.

  • Resources for

    Advances in Elliptic Curve Cryptography

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email cflack@cambridge.org

  • Editors

    Ian F. Blake, University of British Columbia, Vancouver

    Gadiel Seroussi, Hewlett-Packard Laboratories, Palo Alto, California

    Nigel P. Smart, University of Bristol

    Contributors

    N. P. Smart, D. Brown, A. W. Dent, E. Oswald, M. Joye, F. Vercauteren, P. Gaudry, F. Hess, S. Galbraith, K. G. Paterson

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email cflack@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×