10% off all books and free delivery over £40
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Topics in Computational Number Theory Inspired by Peter L. Montgomery

View All Editions

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Topics in Computational Number Theory Inspired by Peter L. Montgomery Synopsis

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.

About This Edition

ISBN: 9781107109353
Publication date: 12th October 2017
Author: Joppe W. Bos
Publisher: Cambridge University Press
Format: Hardback
Pagination: 276 pages
Genres: Number theory