Topics in Computational Number Theory Inspired by Peter L. Montgomery

Nonfiction, Science & Nature, Mathematics, Number Theory, History
Cover of the book Topics in Computational Number Theory Inspired by Peter L. Montgomery by , Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9781108547130
Publisher: Cambridge University Press Publication: October 12, 2017
Imprint: Cambridge University Press Language: English
Author:
ISBN: 9781108547130
Publisher: Cambridge University Press
Publication: October 12, 2017
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book Heuristics and Biases by
Cover of the book ECMO in the Adult Patient by
Cover of the book An Introduction to International Relations by
Cover of the book The Ruin of Roman Britain by
Cover of the book Equity and Administration by
Cover of the book Optimization in Practice with MATLAB® by
Cover of the book Mathematical Aspects of Quantum Field Theory by
Cover of the book Successful Strategies by
Cover of the book Institutions and Ideology in Republican Rome by
Cover of the book Law and Development Perspective on International Trade Law by
Cover of the book Harmonic and Subharmonic Function Theory on the Hyperbolic Ball by
Cover of the book Party Pursuits and The Presidential-House Election Connection, 1900–2008 by
Cover of the book Japan's Castles by
Cover of the book The Cambridge Handbook of Motivation and Learning by
Cover of the book The Foundations of American Jewish Liberalism by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy