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
Väzba: Brožovaná
Dostupnosť: Skladom u dodávateľa
Odosielame za 5-8 dní
42.53
At present, little can be proven under the definitions of modern cryptography. To prove that a crypt...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
2013
Stránok
112
EAN
9783843304047
Enbook ID
02265734
Hmotnosť
185
Rozmery
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 zaujímať

Gate of the Sun

Derek Lambert
15.61
24.06

Carnal Knowing

Margaret R. Miles
22.39
12.76

Golden Atlas

EDWARD BROOKE HITCHI
25.73

6001 The Sleepers

W R Widerberg
11.19

The Red Room

H G Wells
7.46
24.85

Fw 190D-9

Gareth Hector
10.90

Scorpion-Fish

Nicolas Bouvier
13.55
157.08

Philosophy of Mind

Peter SmithO. R. Jones
97.84

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Matemáticas II, 2 bachillerato LOMCE

Almudena . . . [et al. ] Pajares García
23.77
8.34
12.47
9.13
11.58

Al di là dell'io

Eva Pierrakos
11.68
23.96
11.39
15.71