CIPHERUNICORN-E

Quality 0.50 · 1 view · Updated 2 months ago

Block cipher

title: "CIPHERUNICORN-E" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["feistel-ciphers"] description: "Block cipher" topic_path: "general/feistel-ciphers" source: "https://en.wikipedia.org/wiki/CIPHERUNICORN-E" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

::summary Block cipher ::

::data[format=table title="Infobox block cipher"]

FieldValue
nameCIPHERUNICORN-E
designersNEC
publish date1998
derived toCIPHERUNICORN-A
certificationCRYPTREC (Candidate)
key size128 bits
block size64 bits
structureFeistel network
rounds16
::

| name = CIPHERUNICORN-E | designers = NEC | publish date = 1998 | derived from = | derived to = CIPHERUNICORN-A | related to = | certification = CRYPTREC (Candidate) | key size = 128 bits | block size = 64 bits | structure = Feistel network | rounds = 16 | cryptanalysis = In cryptography, CIPHERUNICORN-E is a block cipher created by NEC in 1998. It was among the cryptographic techniques recommended for Japanese government use by CRYPTREC in 2003. However, it has been dropped to "candidate" level by the CRYPTREC revision of 2013.

The algorithm has a 16-round modified Feistel network structure, with an additional key-dependent mixing function after every 2 rounds. The block size is 64 bits, and the key size 128 bits. The round function is fairly complicated, split into two nearly parallel computations.

The first part (called the main stream by the designers) consists of XORs and S-box lookups, with a few choices influenced by the second part. This second function (called temporary key generation) uses more XORs and two operations which are equivalent to modular multiplications. Subkeys are added at various stages of both parts of the round function. There are 4 S-boxes in all, each with 8-bit inputs and outputs.

In 2000, NEC used the same high-level structure, with more elaborate components, to design the CIPHERUNICORN-A cipher.

CIPHERUNICORN-E's key schedule uses a nested Feistel network, based on some of the same building blocks as the cipher itself.

The complexity of CIPHERUNICORN-E's round function has made it difficult to analyze. Some limited analysis has been done on simplified variants, showing that they are likely resistant to both differential and linear cryptanalysis.

References

  • ISO/IEC9979-0019 Register Entry (PDF), registered 6 July 1998 (includes sample implementation source code)
  • {{cite web | author = Matt Robshaw | title = A Cryptographic Review of CIPHERUNICORN-E | date = 14 December 2001 | url = http://www.ipa.go.jp/security/enc/CRYPTREC/fy15/doc/1031_uni-e.pdf | access-date = 21 January 2007 | archive-date = 26 September 2007 | archive-url = https://web.archive.org/web/20070926205448/http://www.ipa.go.jp/security/enc/CRYPTREC/fy15/doc/1031_uni-e.pdf | url-status = dead
  • {{cite web | author = David Wagner | title = An Evaluation of the Security of CIPHERUNICORN-E Against Certain Attacks | date = 17 December 2001 | url = http://www.ipa.go.jp/security/enc/CRYPTREC/fy15/doc/1032_UNI-E.pdf | access-date = 21 January 2007 | archive-date = 26 September 2007 | archive-url = https://web.archive.org/web/20070926205454/http://www.ipa.go.jp/security/enc/CRYPTREC/fy15/doc/1032_UNI-E.pdf | url-status = dead

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::

feistel-ciphers