Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Topics in Computational Number Theory Inspired by Peter L. Montgomery

Topics in Computational Number Theory Inspired by Peter L. Montgomery

$125.00 (C)

Joppe W. Bos, Arjen K. Lenstra, Herman te Riele, Daniel Shumow, Peter L. Montgomery, Colin D. Walter, Daniel J. Bernstein, Tanja Lange, Thorsten Kleinjung, Emmanuel Thomé, Richard P. Brent, Alexander Kruppa, Paul Zimmermann, Kristin Lauter, Michael Naehrig
View all contributors
  • Date Published: October 2017
  • availability: In stock
  • format: Hardback
  • isbn: 9781107109353

$ 125.00 (C)
Hardback

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
  • Peter L. Montgomery has made significant contributions to computational number theory, introducing many basic tools such as Montgomery multiplication, Montgomery simultaneous inversion, Montgomery curves, and the Montgomery ladder. This book features state-of-the-art research in computational number theory related to Montgomery's work and its impact on computational efficiency and cryptography. Topics cover a wide range of topics such as Montgomery multiplication for both hardware and software implementations; Montgomery curves and twisted Edwards curves as proposed in the latest standards for elliptic curve cryptography; and cryptographic pairings. This book provides a comprehensive overview of integer factorization techniques, including dedicated chapters on polynomial selection, the block Lanczos method, and the FFT extension for algebraic-group factorization algorithms. Graduate students and researchers in applied number theory and cryptography will benefit from this survey of Montgomery's work.

    • Provides a comprehensive overview of Peter L. Montgomery's contributions to number field and cryptography
    • Serves as a textbook for a wide range of computational number theory topics
    • Includes contributions by leading experts on each topic
    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: October 2017
    • format: Hardback
    • isbn: 9781107109353
    • length: 276 pages
    • dimensions: 235 x 156 x 19 mm
    • weight: 0.52kg
    • availability: In stock
  • Table of Contents

    1. Introduction Joppe W. Bos, Arjen K. Lenstra, Herman te Riele and Daniel Shumow
    2. Montgomery arithmetic from a software perspective Joppe W. Bos and Peter L. Montgomery
    3. Hardware aspects of Montgomery modular multiplication Colin D. Walter
    4. Montgomery curves and the Montgomery ladder Daniel J. Bernstein and Tanja Lange
    5. General purpose integer factoring Arjen K. Lenstra
    6. Polynomial selection for the number field sieve Thorsten Kleinjung
    7. The block lanczos algorithm Emmanuel Thomé
    8. FFT extension for algebraic-group factorization algorithms Richard P. Brent, Alexander Kruppa and Paul Zimmermann
    9. Cryptographic pairings Kristin Lauter and Michael Naehrig.

  • Editors

    Joppe W. Bos, NXP Semiconductors, Belgium
    Joppe W. Bos is a cryptographic researcher at the Innovation Center for Cryptography and Security at NXP Semiconductors, Belgium. He also currently serves as the Secretary of the International Association for Cryptologic Research (IACR). His research focuses on computational number theory and high-performance arithmetic as used in public-key cryptography.

    Arjen K. Lenstra, EPFL, Lausanne, Switzerland
    Arjen K. Lenstra is Professor of Computer Science at �cole Polytechnique F�d�rale de Lausanne. His research focuses on cryptography and computational number theory, especially in areas such as integer factorization. He was closely involved in the development of the number field sieve method for integer factorization as well as several other cryptologic results. He is the recipient of the Excellence in the Field of Mathematics RSA Conference 2008 Award and a Fellow of the International Association for Cryptologic Research (IACR).

    Contributors

    Joppe W. Bos, Arjen K. Lenstra, Herman te Riele, Daniel Shumow, Peter L. Montgomery, Colin D. Walter, Daniel J. Bernstein, Tanja Lange, Thorsten Kleinjung, Emmanuel Thomé, Richard P. Brent, Alexander Kruppa, Paul Zimmermann, Kristin Lauter, Michael Naehrig

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 lecturers@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 ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.
×