Kniha Provably secure constructions in cryptography Sergey Nikolenko

Provably secure constructions in cryptography

Weak definitions of security and cryptographic constructions that can be proven secure under these definitions

Jazyk: Angličtina
Vazba: Brožovaná
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
967
At present, little can be proven under the definitions of modern cryptography. To prove that a crypt...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2013
Stránek
112
EAN
9783843304047
Enbook ID
02265734
Hmotnost
185
Rozměry
150 x 220 x 7

Kompletní popis

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.

Mohlo by vás zajímat

Gate of the Sun

Derek Lambert
351

Carnal Knowing

Margaret R. Miles
541
309

Golden Atlas

EDWARD BROOKE HITCHI
538

6001 The Sleepers

W R Widerberg
271

The Red Room

H G Wells
180
600

Fw 190D-9

Gareth Hector
322

Scorpion-Fish

Nicolas Bouvier
306
3 624

Philosophy of Mind

Peter SmithO. R. Jones
2 364

Zákaznicí kteří koupili tuto knihu koupili také

Matemáticas II, 2 bachillerato LOMCE

Almudena . . . [et al. ] Pajares García
574
203
303
221
279

Al di là dell'io

Eva Pierrakos
267
579
275
359