Information AboutKasumi |
| CATEGORIES ABOUT KASUMI | |
| japanese given names | |
|
KASUMI has a Block Size of 64 bits and a Key Size of 128 bits. It is a Feistel Cipher with eight rounds, and like MISTY1 and MISTY2 , it has a recursive structure, with subcomponents also having a Feistel-like form. In 2001 , an Impossible Differential Attack on six rounds of KASUMI was presented by Kühn (2001). In 2005, Israeli researchers Eli Biham, Orr Dunkelman and Nathan Keller published a related-key Rectangle (boomerang) Attack on KASUMI that can break all 8 rounds faster than exhaustive search. The attack requires 254.6 chosen plaintexts, each of which has been encrypted under one of four related keys, and has a time complexity equivalent to 276.1 KASUMI encryptions. While this is not a practical attack, it invalidates some proofs about the security of the 3GPP protocols that had relied on the presumed strength of KASUMI. SEE ALSO REFERENCES
EXTERNAL LINKS |
|
|