{"product_id":"provably-secure-constructions-in-cryptography-von-sergey-nikolenko","title":"Provably secure constructions in cryptography","description":"\u003cp\u003eAt 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783843304047\"\u003e\u003ch3\u003eWeak definitions of security and cryptographic constructions that can be proven secure under these definitions\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783843304047","offer_id":39469209157725,"sku":"9783843304047","price":49.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/ae1d121b-118b-44ec-9741-0a38a1d659f0.jpg?v=1756271783","url":"https:\/\/shop.autorenwelt.de\/products\/provably-secure-constructions-in-cryptography-von-sergey-nikolenko","provider":"Autorenwelt Shop","version":"1.0","type":"link"}