High Quality Content by WIKIPEDIA articles! Imagine that you have a secret key X that has n uniform random bits, and you would like to use this secret key to encrypt a message. Unfortunately, you were a bit careless with the key, and know that an adversary was able to learn about t < n bits of that key, but you do not know which. Can you still use your key, or do you have to throw it away and choose a new key? The leftover hash-lemma tells us that we can produce a key of almost n ? t bits, over which the adversary has almost no knowledge. Since the adversary knows all but n ? t bits, this is almost optimal.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.