Topics in Computational Number Theory Inspired by Peter L. Montgomery

This is the homepage of the book titled “Topics in Computational Number Theory Inspired by Peter L. Montgomery” edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge University Press. The page provides links to the author versions of the chapters in the book.

You can buy the book through the Cambridge University Press webpage.
See also Google or Amazon.

Thanks to Nicole Verna for the cover design.

Table of Contents

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