network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 6 months |
| seen | Oct 26 '12 at 15:29 | |
| stats | profile views | 3 |
|
Oct 24 |
awarded | Student |
|
Oct 24 |
comment |
Why is a non fixed-length encryption scheme worse than a fixed-length one? I am not sure about the part of the length of the corresponding ciphertext: note that in the Definition I gave above the Encryption algorithm $Enc$ is a PPT algorithm, therefore we know that $\forall n$ (security parameter) $\forall m$, $||Enc(m)|| < l(||k||+||m||)$, where $l(x) \in \mathbb{Z}[X]$, so we know that the length (i.e. the number of bits, denoted by $||\cdot||$ ) is polynomially bounded, so I don't think we can say that we know the length of the corresponding ciphertext... |
|
Oct 24 |
asked | Why is a non fixed-length encryption scheme worse than a fixed-length one? |
