Iraqi block cipher: Difference between revisions
imported>Lukyluk9 No edit summary |
imported>Villaida removed stub template |
||
| Line 2: | Line 2: | ||
{{Primary sources|article|date=August 2008}}In [[cryptography]], the '''Iraqi block cipher''' was a [[block cipher]] published in [[C (programming language)|C]] [[source code]] form by [[anonymous FTP]] upload around July 1999, and widely distributed on [[Usenet]]. It is a five round [[Feistel cipher|unbalanced Feistel cipher]] operating on a [[Block size (cryptography)|256 bit block]] with a [[key size|160 bit key]]. | {{Primary sources|article|date=August 2008}}In [[cryptography]], the '''Iraqi block cipher''' was a [[block cipher]] published in [[C (programming language)|C]] [[source code]] form by [[anonymous FTP]] upload around July 1999, and widely distributed on [[Usenet]]. It is a five round [[Feistel cipher|unbalanced Feistel cipher]] operating on a [[Block size (cryptography)|256 bit block]] with a [[key size|160 bit key]]. | ||
The source code shows that the algorithm operates on blocks of 32 bytes (or 256 bits). That's four times larger than DES or 3DES (8 bytes) and twice as big as Twofish or AES (16 bytes). | The source code shows that the algorithm operates on blocks of 32 bytes (or 256 bits). That's four times larger than DES or 3DES (8 bytes) and twice as big as Twofish or AES (16 bytes). It also shows that the key size can vary from 160 to 2048 bits. | ||
It also shows that the key size can vary from 160 to 2048 bits. | |||
A detailed analysis of the source code of the algorithm shows that it uses a 256-byte S-Box that is key-dependant (as on Blowfish, it uses a first fixed S table that will generate, with the key, the second S-Box used for encryption/decryption). The algorithm also uses a 16-column x 16-row P-Box, which is also key-dependent and also initialized from a fixed P table. Each round uses one row from P-Box and 16 columns, which means that the algorithm can use up to 16 rounds. | A detailed analysis of the source code of the algorithm shows that it uses a 256-byte S-Box that is key-dependant (as on Blowfish, it uses a first fixed S table that will generate, with the key, the second S-Box used for encryption/decryption). The algorithm also uses a 16-column x 16-row P-Box, which is also key-dependent and also initialized from a fixed P table. Each round uses one row from P-Box and 16 columns, which means that the algorithm can use up to 16 rounds. | ||
| Line 31: | Line 30: | ||
[[Category:Internet hoaxes]] | [[Category:Internet hoaxes]] | ||
[[Category:1999 hoaxes]] | [[Category:1999 hoaxes]] | ||
Latest revision as of 13:29, 10 July 2025
Template:Short description Script error: No such module "Unsubst".In cryptography, the Iraqi block cipher was a block cipher published in C source code form by anonymous FTP upload around July 1999, and widely distributed on Usenet. It is a five round unbalanced Feistel cipher operating on a 256 bit block with a 160 bit key.
The source code shows that the algorithm operates on blocks of 32 bytes (or 256 bits). That's four times larger than DES or 3DES (8 bytes) and twice as big as Twofish or AES (16 bytes). It also shows that the key size can vary from 160 to 2048 bits.
A detailed analysis of the source code of the algorithm shows that it uses a 256-byte S-Box that is key-dependant (as on Blowfish, it uses a first fixed S table that will generate, with the key, the second S-Box used for encryption/decryption). The algorithm also uses a 16-column x 16-row P-Box, which is also key-dependent and also initialized from a fixed P table. Each round uses one row from P-Box and 16 columns, which means that the algorithm can use up to 16 rounds.
A comment suggests that it is of Iraqi origin. However, like the S-1 block cipher, it is generally regarded as a hoax, although of lesser quality than S-1. Although the comment suggests that it is Iraqi in origin, all comments, variable and function names and printed strings are in English rather than Arabic; the code is fairly inefficient (including some pointless operations), and the cipher's security may be flawed (no proof).
Because it has a constant key schedule the cipher is vulnerable to a slide attack. However, it may take 264 chosen texts to create a single slid pair, which would make the attack unfeasible. It also has many fixed points, although that is not necessarily a problem, except possibly for hashing modes. No public attack is currently available. As with S-1, it was David Wagner who first spotted the security flaws.[1]
References
<templatestyles src="Reflist/styles.css" />
- ↑ Script error: No such module "citation/CS1".
Script error: No such module "Check for unknown parameters".
External links
- Source code for the cipher
- File encryption with IBC in ECB and CBC Mode
- Source code of the Iraqi block cipher ECB Mode
- Source code for Microsoft Visual C++ 5.0 ECB Mode
- Compiled code (Console Application) ECB Mode
- Source code of the Iraqi block cipher CBC Mode
- Source code for Microsoft Visual C++ 5.0 CBC Mode
- Compiled code (Console Application) CBC Mode
Script error: No such module "Navbox".