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 Edmund Burke and the Art of Rhetoric by
Cover of the book Preposition Placement in English by
Cover of the book International Commercial Tax by
Cover of the book Camera Aloft by
Cover of the book Semiconductor Nanolasers by
Cover of the book Pattern Formation and Dynamics in Nonequilibrium Systems by
Cover of the book The Cambridge Companion to Twentieth-Century Irish Drama by
Cover of the book Integration of Passive RF Front End Components in SoCs by
Cover of the book America's West by
Cover of the book Hard-to-Survey Populations by
Cover of the book The French Who Fought for Hitler by
Cover of the book Kant: Critique of Practical Reason by
Cover of the book Greeks and Barbarians by
Cover of the book The Missing American Jury by
Cover of the book What Is Intelligence? 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