| 词条 | Hierocrypt |
| 释义 |
| name = Hierocrypt-L1 | designers = Toshiba | publish date = 2000 | derived from = | derived to = | related to = Hierocrypt-3 | certification = CRYPTREC (Candidate) | key size = 128 bits | block size = 64 bits | structure = Nested SPN | rounds = 6.5 | cryptanalysis = Integral attack against 3.5 rounds[1] }}{{Infobox block cipher | name = Hierocrypt-3 | designers = Toshiba | publish date = 2000 | derived from = | derived to = | related to = Hierocrypt-L1 | certification = CRYPTREC (Candidate) | key size = 128, 192, or 256 bits | block size = 128 bits | structure = Nested SPN | rounds = 6.5, 7.5, or 8.5 | cryptanalysis = Meet-in-the-middle attack against 4 rounds[2] }} In cryptography, Hierocrypt-L1 and Hierocrypt-3 are block ciphers created by Toshiba in 2000. They were submitted to the NESSIE project, but were not selected.[3] Both algorithms were among the cryptographic techniques recommended for Japanese government use by CRYPTREC in 2003, however, both have been dropped to "candidate" by CRYPTREC revision in 2013. The Hierocrypt ciphers are very similar, differing mainly in block size: 64 bits for Hierocrypt-L1, 128 bits for Hierocrypt-3. Hierocrypt-L1's key size is 128 bits, while Hierocrypt-3 can use keys of 128, 192, or 256 bits. The number of rounds of encryption also varies: Hierocrypt-L1 uses 6.5 rounds, and Hierocrypt-3 uses 6.5, 7.5, or 8.5, depending on the key size. The Hierocrypt ciphers use a nested substitution-permutation network (SPN) structure. Each round consists of parallel applications of a transformation called the XS-box, followed by a linear diffusion operation. The final half-round replaces the diffusion with a simple post-whitening. The XS-box, which is shared by the two algorithms, is itself an SPN, consisting of a subkey XOR, an S-box lookup, a linear diffusion, another subkey XOR, and another S-box lookup. The diffusion operations use two MDS matrices, and there is a single 8×8-bit S-box. The key schedule uses the binary expansions of the square roots of some small integers as a source of "nothing up my sleeve numbers". No analysis of the full ciphers has been announced, but certain weaknesses were discovered in the Hierocrypt key schedule, linear relationships between the master key and some subkeys. There has also been some success applying integral cryptanalysis to reduced-round Hierocrypt variants; attacks faster than exhaustive search have been found for 3.5 rounds of each cipher. References1. ^{{cite conference | author = P. Barreto, V. Rijmen, J. Nakahara Jr., B. Preneel, Joos Vandewalle, Hae Yong Kim | title = Improved SQUARE attacks against reduced-round HIEROCRYPT | conference = 8th International Workshop on Fast Software Encryption (FSE 2001) | pages = 165–173 | publisher = Springer-Verlag | date = April 2001 | location = Yokohama, Japan | doi = 10.1007/3-540-45473-X_14 | format = PDF/PostScript | accessdate = 2018-08-12 }} 2. ^{{cite book | title=Progress in Cryptology – LATINCRYPT 2015 | publisher=Springer International Publishing | year=2015 | pages=187-203 | isbn=978-3-319-22174-8 | volume=9230 | DOI=10.1007/978-3-319-22174-8_11 | series=Lecture Notes in Computer Science | chapter=Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3 | first1=Ahmed | last1=Abdelkhalek | first2=Riham | last2=AlTawy | last3=Tolba | first3=Mohamed | last4=Youssef | first4=Amr M.}} 3. ^{{cite web| url=https://www.cosic.esat.kuleuven.be/nessie/deliverables/D13.pdf| title=Security evaluation of NESSIE first phase| editors=Sean Murphy and Juliette White| date=2001-09-23| format=PDF| accessdate=2018-08-12}} External links
1 : Block ciphers |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。