Contacto
Cómo comprar
Entrega
Guía de compras
Provably secure constructions in cryptography
Weak definitions of security and cryptographic constructions that can be proven secure under these definitions
Inglés
118 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
11.59
€
/
Tapa blanda
85.39
€
At present, little can be proven under the definitions of modern cryptography. To prove that a cryptosystem is secure, one would first have to prove that P does not equal NP. This book is devoted to cryptographic constructions that can be proven secure in a weaker sense. We cover three topics in the book. Complete one-way functions are one-way if there are any one-way functions at all. Feebly secure cryptographic primitives can be proven secure in the strongest classical model of computation, namely general circuit complexity, but security guarantees are only constant. Finally, algebraic cryptography provides examples of noncommutative constructions that are secure against provable break, i.e., against an adversary who can present encoding examples for the messages he deciphers.
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
135.29
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?