Topics in Computational Number Theory Inspired by Peter L. Montgomery

Author:   Joppe W. Bos ,  Arjen K. Lenstra
Publisher:   Cambridge University Press
ISBN:  

9781107109353


Pages:   276
Publication Date:   12 October 2017
Format:   Hardback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $302.74 Quantity:  
Add to Cart

Share |

Topics in Computational Number Theory Inspired by Peter L. Montgomery


Add your own review!

Overview

Full Product Details

Author:   Joppe W. Bos ,  Arjen K. Lenstra
Publisher:   Cambridge University Press
Imprint:   Cambridge University Press
Dimensions:   Width: 15.60cm , Height: 1.90cm , Length: 23.50cm
Weight:   0.520kg
ISBN:  

9781107109353


ISBN 10:   1107109353
Pages:   276
Publication Date:   12 October 2017
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1. Introduction Joppe W. Bos, Arjen K. Lenstra, Herman te Riele and Daniel Shumow; 2. Montgomery arithmetic from a software perspective Joppe W. Bos and Peter L. Montgomery; 3. Hardware aspects of Montgomery modular multiplication Colin D. Walter; 4. Montgomery curves and the Montgomery ladder Daniel J. Bernstein and Tanja Lange; 5. General purpose integer factoring Arjen K. Lenstra; 6. Polynomial selection for the number field sieve Thorsten Kleinjung; 7. The block lanczos algorithm Emmanuel Thomé; 8. FFT extension for algebraic-group factorization algorithms Richard P. Brent, Alexander Kruppa and Paul Zimmermann; 9. Cryptographic pairings Kristin Lauter and Michael Naehrig.

Reviews

Author Information

Joppe W. Bos is a cryptographic researcher at the Innovation Center for Cryptography and Security at NXP Semiconductors, Belgium. He also currently serves as the Secretary of the International Association for Cryptologic Research (IACR). His research focuses on computational number theory and high-performance arithmetic as used in public-key cryptography. Arjen K. Lenstra is Professor of Computer Science at École Polytechnique Fédérale de Lausanne. His research focuses on cryptography and computational number theory, especially in areas such as integer factorization. He was closely involved in the development of the number field sieve method for integer factorization as well as several other cryptologic results. He is the recipient of the Excellence in the Field of Mathematics RSA Conference 2008 Award and a Fellow of the International Association for Cryptologic Research (IACR).

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

lgn

al

Shopping Cart
Your cart is empty
Shopping cart
Mailing List