词条 | KN-Cipher |
释义 |
| name = KN-Cipher | designers = Kaisa Nyberg and Lars Knudsen | publish date = 1995 | derived from = | derived to = | related to = | certification = | key size = 198 bits | block size = 64 bits | structure = Feistel network | rounds = 6 | cryptanalysis = Jakobsen & Knudsen's higher order differential cryptanalysis breaks KN-Cipher with only 512 chosen plaintexts and 241 running time, or with 32 chosen plaintexts and 270 running time.[1] }} In cryptography, KN-Cipher is a block cipher created by Kaisa Nyberg and Lars Knudsen in 1995. One of the first ciphers designed to be provably secure against ordinary differential cryptanalysis, KN-Cipher was later broken using higher order differential cryptanalysis. Presented as "a prototype...compatible with DES", the algorithm has a 64-bit block size and a 6-round Feistel network structure. The round function is based on the cube operation in the finite field GF(233). The designers did not specify any key schedule for the cipher; they state, "All round keys should be independent, therefore we need at least 198 key bits." CryptanalysisJakobsen & Knudsen's higher order differential cryptanalysis breaks KN-Cipher with only 512 chosen plaintexts and 241 running time, or with 32 chosen plaintexts and 270 running time.[1] References1. ^1 2 {{cite conference | author = T. Jakobsen, L.R. Knudsen | title = The Interpolation Attack on Block Ciphers | conference = 4th International Workshop on Fast Software Encryption (FSE '97) | pages = 28–40 | publisher = Springer-Verlag | date = January 1997 | location = Haifa | url = http://citeseer.ist.psu.edu/jakobsen97interpolation.html | format = PDF/PostScript | accessdate = 23 January 2007}} [1]}}{{Cryptography navbox | block| state=collapsed}} 2 : Broken block ciphers|Feistel ciphers |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。