Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Iraqi block cipher
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Cipher}} {{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). 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 (computer programming)|comment]] suggests that it is of [[Iraq]]i 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 [[string (computer science)|string]]s 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 2<sup>64</sup> chosen texts to create a single slid pair, which would make the attack unfeasible. It also has many [[fixed point (mathematics)|fixed point]]s, 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 A. Wagner|David Wagner]] who first spotted the security flaws.<ref> {{cite newsgroup |title=Re: Question about iraqi block cipher |author=David A. Wagner |date=2000-05-08 |newsgroup=sci.crypt |message-id=8f75u3$jvl$1@blowfish.isaac.cs.berkeley.edu |url=https://groups.google.com/group/sci.crypt/msg/fd2f199b8514b8e5?dmode=source |access-date=2008-08-20}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)