Sammanfattning
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.
Originalspråk | engelska |
---|---|
Sidor (från-till) | 197-206 |
Tidskrift | Problems of Information Transmission |
Volym | 34 |
Nummer | 2 |
Status | Published - 1998 |
Ämnesklassifikation (UKÄ)
- Elektroteknik och elektronik