|
|
|
|
| LEADER |
03584nam a22004935i 4500 |
| 001 |
4568 |
| 003 |
DE-He213 |
| 005 |
20130824030851.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 xxu| s |||| 0|eng d |
| 020 |
# |
# |
|a 9780387772684
|9 978-0-387-77268-4
|
| 024 |
7 |
# |
|a 10.1007/978-0-387-77268-4
|2 doi
|
| 100 |
1 |
# |
|a Yan, Song Y.
|e author.
|
| 245 |
1 |
0 |
|a Primality Testing and Integer Factorization in Public-Key Cryptography
|c by Song Y. Yan.
|h [electronic resource] /
|
| 264 |
# |
1 |
|a Boston, MA :
|b Springer US :
|b Imprint: Springer,
|c 2009.
|
| 300 |
# |
# |
|a XVIII, 371 p. 40 illus.
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Advances in Information Security,
|v 11
|x 1568-2633 ;
|
| 505 |
0 |
# |
|a Preface to the Second Edition -- Preface to the First Edition -- Number-Theoretic Preliminaries -- Primality Testing and Prime Generation -- Integer Factorization and Discrete Logarithms -- Number-Theoretic Cryptography -- Bibliography -- Index -- About the Author.
|
| 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.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Computer Communication Networks.
|
| 650 |
# |
0 |
|a Data protection.
|
| 650 |
# |
0 |
|a Data structures (Computer science).
|
| 650 |
# |
0 |
|a Data encryption (Computer science).
|
| 650 |
# |
0 |
|a Coding theory.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Data Encryption.
|
| 650 |
2 |
4 |
|a Data Structures, Cryptology and Information Theory.
|
| 650 |
2 |
4 |
|a Systems and Data Security.
|
| 650 |
2 |
4 |
|a Coding and Information Theory.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9780387772677
|
| 830 |
# |
0 |
|a Advances in Information Security,
|v 11
|x 1568-2633 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-387-77268-4
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|