This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ms that license fees will be very small, but you’d better check with them. 14.9 Other Block Algorithms
There is an algorithm called CRYPTO-MECCANO in the literature ; it is insecure. Four Japanese cryptographers presented an algorithm based on chaotic maps at Eurocrypt ’91 [687, 688]; Biham cryptanalyzed the algorithm at the same conference . Another algorithm relies on subsets of a particular set of random codes . There are several algorithms based on the theory of error-correcting codes: a variant of the McEliece algorithm (see Section 19.7) [786,1290], the Rao-Nam algorithm [1292,733,1504,1291,1056,1057,1058,1293], variants of the Rao-Nam algorithm [464,749,1503], and the Li-Wang algorithm [964,1561]—they are all insecure. CALC is insecure . An algorithm called TEA, for Tiny Encryption Algorithm, is too new to comment on . Vino is another algorithm . MacGuffin, a block algorithm by Matt Blaze and me, is also insecure ; it was broken at the same conference it was proposed. BaseKing, similar in design philosophy as 3-way but with a 192-bit block , is too new to comment on. There are many more block algorithms outside the cryptology community. Some are used by various government and military organizations. I have no information about any of those. There are also dozens of proprietary commercial algorithms. Some might be good; most are probably not. If companies do not feel that their interests are served by making their algorithms public, it is best to assume they’re right and avoid the algorithm. 14.10 Theory of Block Cipher Design
In Section 11.1, I described Shannon’s principles of confusion and diffusion. Fifty years after these principles were first written, they remain the cornerstone of good block cipher design. Confusion serves to hide any relationship between the plaintext, the ciphertext, and the key. Remember how linear and differential cryptanalysis can exploit even a slight relationship between these three...
View Full Document
This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.
- Fall '10