|
|
|
|
| LEADER |
03092nmm a2200421 u 4500 |
| 001 |
EB000356531 |
| 003 |
EBX01000000000000000209583 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9780387772684
|
| 100 |
1 |
|
|a Yan, Song Y.
|
| 245 |
0 |
0 |
|a Primality Testing and Integer Factorization in Public-Key Cryptography
|h Elektronische Ressource
|c by Song Y. Yan
|
| 250 |
|
|
|a 2nd ed. 2009
|
| 260 |
|
|
|a New York, NY
|b Springer US
|c 2009, 2009
|
| 300 |
|
|
|a XVIII, 371 p. 40 illus
|b online resource
|
| 505 |
0 |
|
|a Number-Theoretic Preliminaries -- Primality Testing and Prime Generation -- Integer Factorization and Discrete Logarithms -- Number-Theoretic Cryptography
|
| 653 |
|
|
|a Coding and Information Theory
|
| 653 |
|
|
|a Number theory
|
| 653 |
|
|
|a Coding theory
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Number Theory
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Data Structures and Information Theory
|
| 653 |
|
|
|a Data protection
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Data structures (Computer science)
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a Data and Information Security
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Advances in Information Security
|
| 028 |
5 |
0 |
|a 10.1007/978-0-387-77268-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-0-387-77268-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.824
|
| 520 |
|
|
|a Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as RSA (invented by Rivest, Shamir and Adleman) relies on the computational intractability of IFP. This monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications to factoring-based Public Key Cryptography. Notable features of this second edition are the several new sections and more than 100 new pages that are added. These include a new section in Chapter 2 on the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test in P; a new section in Chapter 3 on recent work in quantum factoring; and a new section in Chapter 4 on post-quantum cryptography. To make the book suitable as an advanced undergraduate and/or postgraduate text/reference, about ten problems at various levels of difficulty are added at the end of each section, making about 300 problems in total contained in the book; most of the problems are research-oriented with prizes ordered by individuals or organizations to a total amount over five million US dollars. Primality Testing and Integer Factorization in Public Key Cryptography is designed for practitioners and researchers in industry and graduate-level students in computer science and mathematics
|