| 000 | 00000cam u2200205 a 4500 | |
| 001 | 000045924707 | |
| 005 | 20171229112127 | |
| 008 | 171229s2017 enka b 001 0deng d | |
| 010 | ▼a 2017023049 | |
| 020 | ▼a 9781107109353 (pbk. : alk. paper) | |
| 035 | ▼a (KERIS)REF000018438666 | |
| 040 | ▼a DLC ▼b eng ▼e rda ▼c DLC ▼d 211009 | |
| 050 | 0 0 | ▼a QA241 ▼b .T657 2017 |
| 082 | 0 0 | ▼a 512.7 ▼2 23 |
| 084 | ▼a 512.7 ▼2 DDCK | |
| 090 | ▼a 512.7 ▼b M788b | |
| 245 | 0 0 | ▼a Topics in computational number theory inspired by Peter L. Montgomery / ▼c edited by Joppe W. Bos, NXP Semiconductors, Belgium; Arjen K. Lenstra, EPFL, Lausanne, Switzerland. |
| 260 | ▼a Cambridge : ▼b Cambridge University Press, ▼c c2017. | |
| 300 | ▼a xiii, 266 p. : ▼b ill. ; ▼c 24 cm. | |
| 490 | 1 | ▼a London Mathematical Society lecture note series |
| 504 | ▼a Includes bibliographical references and index. | |
| 600 | 1 0 | ▼a Montgomery, Peter L., ▼d 1947-. |
| 650 | 0 | ▼a Number theory. |
| 650 | 0 | ▼a Cryptography ▼x Mathematics. |
| 700 | 1 | ▼a Bos, Joppe W. |
| 700 | 1 | ▼a Lenstra, A. K. ▼q (Arjen K.), ▼d 1956-. |
| 830 | 0 | ▼a London Mathematical Society lecture note series. |
| 945 | ▼a KLPA |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Science & Engineering Library/Sci-Info(Stacks2)/ | Call Number 512.7 M788b | Accession No. 121242832 | Availability Available | Due Date | Make a Reservation | Service |
Contents information
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 Thome; 8. FFT extension for algebraic-group factorization algorithms Richard P. Brent, Alexander Kruppa and Paul Zimmermann; 9. Cryptographic pairings Kristin Lauter and Michael Naehrig.
Information Provided By: :
