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 Networks in Contention by
Cover of the book Applied Choice Analysis by
Cover of the book Witchcraft and Inquisition in Early Modern Venice by
Cover of the book Thermodynamics, Kinetics, and Microphysics of Clouds by
Cover of the book The Severity of God by
Cover of the book Sex, Freedom, and Power in Imperial Germany, 1880–1914 by
Cover of the book Principles of Financial Economics by
Cover of the book Rural Nursing by
Cover of the book Introduction to Many-Body Physics by
Cover of the book Thucydides on Politics by
Cover of the book The Cambridge Handbook of Creativity by
Cover of the book Beckett, Modernism and the Material Imagination by
Cover of the book The Nationalization of American Political Parties, 1880–1896 by
Cover of the book Treatment of Dystonia by
Cover of the book Sites of Memory, Sites of Mourning 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