You might also like

More about Provably secure constructions in cryptography

• Book details
• Synopsis
• Trending among others

You get 117 loyalty points

Book synopsis

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.

Book details

• Full title: Provably secure constructions in cryptography
• Subtitle: Weak definitions of security and cryptographic constructions that can be proven secure under these definitions
• Author: Sergey Nikolenko
• Language: English
• Binding: Paperback
• Number of pages: 112
• EAN: 9783843304047
• ID: 02265734
• Publisher: LAP Lambert Academic Publishing
• Weight: 185 g
• Dimensions: 220 × 150 × 7 mm
• Date of publishing: 16. November 2013

Trending among others

---

---

---