词条 | Treyfer |
释义 |
| name = Treyfer | designers = Gideon Yuval | publish date = 1997 | derived from = | derived to = | related to = | key size = 64 bits | block size = 64 bits | structure = | rounds = 32 | cryptanalysis = A slide attack using 232 known plaintexts and 244 work succeeds for any number of rounds }} In cryptography, Treyfer is a block cipher/MAC designed in 1997 by Gideon Yuval. Aimed at smart card applications, the algorithm is extremely simple and compact; it can be implemented in just 29 bytes of 8051 machine code{{citation needed|date=October 2016}}. Treyfer has a rather small key size and block size of 64 bits each. All operations are byte-oriented, and there is a single 8×8-bit S-box. The S-box is left undefined; the implementation can simply use whatever data is available in memory. In each round, each byte has added to it the S-box value of the sum of a key byte and the previous data byte, then it is rotated left one bit. The design attempts to compensate for the simplicity of this round transformation by using a large number of rounds: 32. Due to the simplicity of its key schedule, using the same 8 key bytes in each round, Treyfer was one of the first ciphers shown to be susceptible to a slide attack. This cryptanalysis, which is independent of the number of rounds and the choice of S-box, requires 232 known plaintexts and 244 computation time. ImplementationA simple implementation of Treyfer can be done as follows: See also
References
| author = David Wagner, Alex Biryukov | title = Slide Attacks | year = 1999 | url = http://www.cs.berkeley.edu/~daw/papers/slide-fse99-pre.ps | format = PostScript | accessdate = January 25, 2007 }}{{Cryptography navbox | block}}{{crypto-stub}} 1 : Broken block ciphers |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。