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 Refuge Lost by
Cover of the book Habitat Suitability and Distribution Models by
Cover of the book Risk and Uncertainty Assessment for Natural Hazards by
Cover of the book Parentheticals in Spoken English by
Cover of the book Space, Place, and Landscape in Ancient Greek Literature and Culture by
Cover of the book 200 More Puzzling Physics Problems by
Cover of the book Autocracy and Redistribution by
Cover of the book The Cambridge Companion to Eighteenth-Century Poetry by
Cover of the book Introduction to Model Spaces and their Operators by
Cover of the book The Fourth Reich by
Cover of the book The Language of Stories by
Cover of the book A New Era for Mental Health Law and Policy by
Cover of the book The Rise of Heritage by
Cover of the book The Conduct of Hostilities under the Law of International Armed Conflict by
Cover of the book Clays in the Minerals Processing Value Chain 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