000			03543nam a22005175i 4500
001			978-0-387-77268-4
003			DE-He213
005			20251006084413.0
007			cr nn 008mamaa
008			100301s2009 xxu| s |||| 0|eng d
020			_a9780387772684
020			_a99780387772684
024	7		_a10.1007/978-0-387-77268-4 _2doi
100	1		_aYan, Song Y. _eauthor.
245	1	0	_aPrimality Testing and Integer Factorization in Public-Key Cryptography _h[electronic resource] / _cby Song Y. Yan.
264		1	_aBoston, MA : _bSpringer US : _bImprint: Springer, _c2009.
300			_aXVIII, 371 p. 40 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aAdvances in Information Security, _x1568-2633 ; _v11
505	0		_aNumber-Theoretic Preliminaries -- Primality Testing and Prime Generation -- Integer Factorization and Discrete Logarithms -- Number-Theoretic Cryptography.
520			_aAlthough 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	_aCOMPUTER SCIENCE.
650		0	_aCOMPUTER COMMUNICATION NETWORKS.
650		0	_aDATA PROTECTION.
650		0	_aDATA STRUCTURES (COMPUTER SCIENCE).
650		0	_aDATA ENCRYPTION (COMPUTER SCIENCE).
650		0	_aCODING THEORY.
650	1	4	_aCOMPUTER SCIENCE.
650	2	4	_aDATA ENCRYPTION.
650	2	4	_aDATA STRUCTURES, CRYPTOLOGY AND INFORMATION THEORY.
650	2	4	_aSYSTEMS AND DATA SECURITY.
650	2	4	_aCODING AND INFORMATION THEORY.
650	2	4	_aDATA STRUCTURES.
650	2	4	_aCOMPUTER COMMUNICATION NETWORKS.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387772677
830		0	_aAdvances in Information Security, _x1568-2633 ; _v11
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-77268-4 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SCS
942			_2ddc _cER
999			_c58947 _d58947