Contacto
Cómo comprar
Entrega
Guía de compras
Primality Testing and Integer Factorization in Public-Key Cryptography
Inglés
414 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
23.49
€
/
Tapa blanda
6.19
€
/
Tapa blanda
11.09
€
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.§Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.§This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.
Sobre el libro
Inglés
Categorías
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
72.49
€
/
Tapa blanda
31.79
€
/
Tapa blanda
57.39
€
/
Tapa blanda
22.79
€
/
Tapa blanda
25.89
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?