Amazon cover image
Image from Amazon.com

Topics in computational number theory : inspired by Peter L. Montgomery

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cambridge Cambridge university press 2017Description: xi, 266p. illISBN:
  • 9781107109353 (HB)
Subject(s):
Contents:
1 - Introduction 2 - Montgomery Arithmetic from a Software Perspective 3 - Hardware Aspects of Montgomery Modular Multiplication 4 - Montgomery Curves and the Montgomery Ladder 5 - General Purpose Integer Factoring 6 - Polynomial Selection for the Number Field Sieve 7 - The Block Lanczos Algorithm 8 - FFT Extension for Algebraic-Group Factorization Algorithms 9 - Cryptographic Pairings
Summary: This book highlights the many ideas and algorithms that Peter L. Montgomery has contributed to computational number theory and cryptography.
Item type: BOOKS List(s) this item appears in: New Arrivals (02 November 2018)
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
IMSc Library 511-3 MON (Browse shelf(Opens below)) Available 74254

Includes index

Includes Bibliography (p. 235-260) and references.

1 - Introduction
2 - Montgomery Arithmetic from a Software Perspective
3 - Hardware Aspects of Montgomery Modular Multiplication
4 - Montgomery Curves and the Montgomery Ladder
5 - General Purpose Integer Factoring
6 - Polynomial Selection for the Number Field Sieve
7 - The Block Lanczos Algorithm
8 - FFT Extension for Algebraic-Group Factorization Algorithms
9 - Cryptographic Pairings

This book highlights the many ideas and algorithms that Peter L. Montgomery has contributed to computational number theory and cryptography.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India