Related Directory Categories
- Ciphers (32)
- Camellia (13)
- Organizations (12)
- Camellia (5)
Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Camellia (cipher)
From Wikipedia, the free encyclopedia
| Camellia | |
| General | |
|---|---|
| Designer(s): | Mitsubishi, NTT |
| First published: | 2000 |
| Derived from: | E2, MISTY1 |
| Certification: | CRYPTREC, NESSIE |
| Cipher detail | |
| Key size(s): | 128, 192 or 256 bits |
| Block size(s): | 128 bits |
| Structure: | Feistel network |
| Rounds: | 18 or 24 |
In cryptography, Camellia is a block cipher that has been evaluated favorably by several organisations, including the European Union's NESSIE project (a selected algorithm), and the Japanese CRYPTREC project (a recommended algorithm). The cipher was developed jointly by Mitsubishi and NTT in 2000, and has similar design elements to earlier block ciphers (MISTY1 and E2) from these companies.
Camellia has a block size of 128 bits, and can use 128-bit, 192-bit or 256-bit keys — the same interface as the Advanced Encryption Standard. It is a Feistel cipher with either 18 rounds (if the key is 128 bits) or 24 rounds (if the key is 192 or 256 bits). Every six rounds, a logical transformation layer is applied: the so-called "FL-function" or its inverse. Camellia uses four 8 x 8-bit S-boxes with input and output affine transformations and logical operations. The cipher also uses input and output key whitening. The diffusion layer uses a linear transformation based on an MDS matrix with a branch number of 5.
In July 2007, support for the Camellia cipher was added to alpha builds of Mozilla Firefox 3.
Contents |
Camellia is one of the ciphers that can be completely defined by minimal systems of multivariate polynomials [1]. The Camellia (as well as AES) S-boxes can be described by a system of 23 quadratic equations in 80 terms [2]. The key schedule can be described by 1120 equations in 768 variables using 3328 linear and quadratic terms [1]. The entire block cipher can be described by 5104 equations in 2816 variables using 14592 linear and quadratic terms [1]. In total, 6224 equations in 3584 variables using 17920 linear and quadratic terms are required [1]. The number of free terms is 11696, which is approximately the same number as for AES. Theoretically, such properties might make it possible to break Camellia (and AES) using an algebraic attack, such as Extended Sparse Linearisation, in the future (provided that the attack becomes feasible).
Although patented, Camellia is available under a royalty-free license.[3] This has allowed the Camellia cipher to become part of the OpenSSL Project, under an Open Source license, as of November 8, 2006.
- Kazumaro Aoki, Tetsuya Ichikawa, Masayuki Kanda, Mitsuru Matsui, Shiho Moriai, Junko Nakajima, Toshio Tokita (2000). "Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design and Analysis". Selected Areas in Cryptography: pp. 39–56, Mitsubishi, NTT. Retrieved on 2006-11-08.
- ^ a b c d Biryukov, De Cannière, Block ciphers and systems of quadratic equations, Springer-Verlag, 2003.
- ^ N. T. Courtois, J. Pieprzyk, Cryptanalysis of block ciphers with overdefined systems of equations, Springer-Verlag, 2002.
- ^ NTT (2001-04-17). Announcement of Royalty-free Licenses for Essential Patents of NTT Encryption and Digital Signature Algorithms. Press release. Retrieved on 2006-11-08.
- Camellia's English home page
- RFC 3657 — Use of the Camellia Encryption Algorithm in Cryptographic Message Syntax (CMS)
- RFC 4312 — The Camellia Cipher Algorithm and Its Use With IPsec
- RFC 4132 — Addition of Camellia Cipher Suites to Transport Layer Security (TLS)
- Bug 382223 — Add support for Camellia to PSM (Mozilla Firefox)