Książka 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

Język: Angielski
Oprawa: Miękka
Dostępność: Dostępna u dostawcy
Wysyłamy za 5-8 dni
179.91
At present, little can be proven under the definitions of modern cryptography. To prove that a crypt...

Informacje o książce

Język
Angielski
Oprawa
Książka - Miękka
Data wydania
2013
strony
112
EAN
9783843304047
Enbook ID
02265734
Waga
185
Wymiary
150 x 220 x 7

Pełny opis

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.

Możesz być zainteresowany

Gate of the Sun

Derek Lambert
65.90
106.89

Carnal Knowing

Margaret R. Miles
101.14
57.43

Golden Atlas

EDWARD BROOKE HITCHI
108.93

6001 The Sleepers

W R Widerberg
49.93

The Red Room

H G Wells
33.28
110.59
29.68

Fw 190D-9

Gareth Hector
46.04

Scorpion-Fish

Nicolas Bouvier
57.24
664.94

Philosophy of Mind

Peter SmithO. R. Jones
434.20

Klienci, którzy kupili tę książkę, kupili również

Matemáticas II, 2 bachillerato LOMCE

Almudena . . . [et al. ] Pajares García
100.56
35.53
53.05
40.78
48.96

Al di là dell'io

Eva Pierrakos
49.45
101.43
39.61
66.39