000 03200nam a22003615i 4500
001 279660
003 MX-SnUAN
005 20160429153954.0
007 cr nn 008mamaa
008 150903s2009 xxu| o |||| 0|eng d
020 _a9780387772684
_99780387772684
024 7 _a10.1007/9780387772684
_2doi
035 _avtls000332796
039 9 _a201509030758
_bVLOAD
_c201404122245
_dVLOAD
_c201404092015
_dVLOAD
_y201402041055
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
100 1 _aYan, Song Y.
_eautor
_9304111
245 1 0 _aPrimality Testing and Integer Factorization in Public-Key Cryptography /
_cby Song Y. Yan.
264 1 _aBoston, MA :
_bSpringer US :
_bImprint: Springer,
_c2009.
300 _axviii, 371 páginas 40 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aAdvances in Information Security,
_x1568-2633 ;
_v11
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387772677
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-77268-4
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c279660
_d279660