Help


from Wikipedia
«  
which takes as input a key K of bit length k, called the key size, and a bit string P of length n, called the block size, and returns a string C of n bits.
P is called the plaintext, and C is termed the ciphertext.
For each K, the function E < sub > K </ sub >( P ) is required to be an invertible mapping on

2.084 seconds.