Contacto
Como comprar
Entrega
Guia de compras
Provably secure constructions in cryptography
Weak definitions of security and cryptographic constructions that can be proven secure under these definitions
Inglês
93 b
Política de devolução de 30 dias
Os clientes também compraram
/
Capa mole
9.51
€
/
Capa mole
68.36
€
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 o livro
Inglês
Categorias
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Capa mole
110.29
€
Olá! Sou o Libroamiko, o seu conselheiro de livros.
Como posso ajudar?