{"id":929,"date":"2012-05-30T17:18:43","date_gmt":"2012-05-30T15:18:43","guid":{"rendered":"https:\/\/webs.uab.cat\/giq\/seminar\/weak-randomness-and-quantum-encryption\/"},"modified":"2012-05-30T17:18:43","modified_gmt":"2012-05-30T15:18:43","slug":"weak-randomness-and-quantum-encryption","status":"publish","type":"seminar","link":"https:\/\/webs.uab.cat\/giq\/seminar\/weak-randomness-and-quantum-encryption\/","title":{"rendered":"Weak randomness and quantum encryption"},"content":{"rendered":"<p><tt>Uniform randomness is a crucial part of many information processing systems,<br \/> including algorithms, data compression, communication complexity, and<br \/> cryptography. The randomness we encounter in the real-world in non-uniform,<br \/> usually as a consequence of imperfectness of the random number generator, or<br \/> due to the partial information the adversary has about the random bit<br \/> string. It turns out that for some problems it is not difficult to design a<br \/> solution tolerating a reasonable deviation from the uniform distribution,<br \/> including algorithmic problems, or e.g. message authentication. It is not<br \/> the case of encryption that vitally requires uniform randomness. In fact,<br \/> regardless of the cryptosystem, key and ciphertext length, knowledge of only<br \/> 2 bits of key suffices to the adversary to determine the plaintext with<br \/> certainty in the classical world. We present a quantum encryption system<br \/> that is able to break the bound and show, that there is no direct equivalent<br \/> of the bound (i.e. no finite information about the key is sufficient for<br \/> this).<\/tt><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Uniform randomness is a crucial part of many information processing systems, including algorithms, data compression, communication complexity, and cryptography. The randomness we encounter in the real-world in non-uniform, usually as a consequence of imperfectness of the random number generator, or due to the partial information the adversary has about the random bit string. It turns [&hellip;]<\/p>\n","protected":false},"author":20,"featured_media":0,"template":"","class_list":["post-929","seminar","type-seminar","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/seminar\/929","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/seminar"}],"about":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/types\/seminar"}],"author":[{"embeddable":true,"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/users\/20"}],"wp:attachment":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/media?parent=929"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}