Abstract
Two methods (including randomization) are studied for increasing the uncertainty concerning n ³ 1 transmitted messages and an applied key. Furthermore, it is shown that encryptions which perform equally well for n = 1 may perform differently when n > 1.
| Original language | English |
|---|---|
| Pages (from-to) | 197-206 |
| Journal | Problems of Information Transmission |
| Volume | 34 |
| Issue number | 2 |
| Publication status | Published - 1998 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering