Contatto
Come acquistare
Consegna
Guida all'acquisto
Provably secure constructions in cryptography
Weak definitions of security and cryptographic constructions that can be proven secure under these definitions
Inglese
127 b
30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
11.59
€
/
In brossura
68.49
€
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.
Informazioni sul libro
Inglese
Categorie
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
133.29
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?