Scribd
Upload
105 views12 pages

CIS 5371 Cryptography: 2. Perfect Secret Encryption

The document discusses perfect secret encryption. It defines perfect secret encryption as an encryption scheme where the probability of a message being encrypted to a particular ciphertext is independent of the message. This means an attacker cannot learn any information about the original message from the ciphertext alone. The document states that the one-time pad encryption scheme is perfectly secret, as each key is used only once. However, for an encryption scheme to be perfectly secret, the size of the key space must be equal to or greater than the size of the message space. Shannon's theorem characterizes perfectly secret encryption schemes as those where the key is selected randomly from the full key space and each message/ciphertext pair is encrypted using a unique key.

Uploaded by

mbscribd2011
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
105 views12 pages

CIS 5371 Cryptography: 2. Perfect Secret Encryption

The document discusses perfect secret encryption. It defines perfect secret encryption as an encryption scheme where the probability of a message being encrypted to a particular ciphertext is independent of the message. This means an attacker cannot learn any information about the original message from the ciphertext alone. The document states that the one-time pad encryption scheme is perfectly secret, as each key is used only once. However, for an encryption scheme to be perfectly secret, the size of the key space must be equal to or greater than the size of the message space. Shannon's theorem characterizes perfectly secret encryption schemes as those where the key is selected randomly from the full key space and each message/ciphertext pair is encrypted using a unique key.

Uploaded by

mbscribd2011
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

CIS 5371 Cryptography

2. Perfect Secret Encryption

Encryption

Encryption
encryption key

Plaintext
decryption key

Ciphertext

Decryption
2

Encryption algorithms

Encryption algorithms
Definition
An encryption scheme (Gen,Enc,Dec) over message space M is perfectly secret if for every probability distribution over M, every message mM, and every ciphertext cC for which Pr[C = c] 0: Pr[M = m | C = c] = Pr[M = m]

Convention:
We consider only probability distributions over M, C that assign non-zero probabilities to all mM and cC.
4

Encryption algorithms
Lemma 1
An encryption scheme (Gen,Enc,Dec) over message space M is perfectly secret if and only if for every probability distribution over M, every message mM, and every ciphertext cC: Pr[C = c | M = m] = Pr[C = c]

Encryption algorithms

Encryption algorithms
An equivalent definition for perfect secrecy

Encryption algorithms

Encryption algorithms

Encryption algorithms
Theorem
The one time pad encryption scheme is perfectly secret.

10

Limitations to perfect secrecy


Theorem
Let (Gen,Enc,Dec) be a perfectly secret encryption scheme over message space M, and let K be the key space as determined by Gen. Then |K| |M| .

11

Shannons Theorem
Theorem
Let (Gen,Enc,Dec) be an encryption scheme over a message space M for which |M|= |K|=|C|. The scheme is perfectly secret if and only if:
1. Every key kK is chosen with equal probability 1/|K| by algorithm Gen. 2. For every mM and every cC there is a unique key kK such that Enck(m) outputs c

12

You might also like