menu

Topics in Computational Number Theory Inspired by Peter L. Montgomery
by Joppe W. Bos and Arjen K. Lenstra




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

  Read Full Product Description
 
local_shippingFor Delivery
In Stock.
This item is Non-Returnable.
FREE Shipping for Club Members help
 
storeBuy Online Pickup At Store
search store by zipcode

 
 
New & Used Marketplace 13 copies from $112.86
 
Download

Format: EPUB What's this?
This item is available only to U.S. and Canada billing addresses.
 
 
 

More About Topics in Computational Number Theory Inspired by Peter L. Montgomery by Joppe W. Bos; Arjen K. Lenstra

 
 
 

Overview

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.


This item is Non-Returnable.

 

Details

  • ISBN-13: 9781107109353
  • ISBN-10: 1107109353
  • Publisher: Cambridge University Press
  • Publish Date: October 2017
  • Page Count: 276
  • Dimensions: 9.2 x 6.2 x 0.6 inches
  • Shipping Weight: 1.11 pounds

Series: London Mathematical Society Lecture Note

Related Categories

 

BAM Customer Reviews