Xmx

XMX may refer to: * xmx, a block cipher * XMX (XM), a satellite radio station * Maden language, an Austronesian language of West Papua

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

XMX may refer to: * xmx, a block cipher * XMX (XM), a satellite radio station * Maden language, an Austronesian language of West Papua

In cryptography, xmx is a block cipher designed in 1997 by David M'Raïhi, David Naccache, Jacques Stern, and Serge Vaudenay. According to the designers it "uses public-key-like operations as confusion and diffusion means." The cipher was designed for efficiency, and the only operations it uses are XORs and modular multiplications.

The main parameters of xmx are variable, including the block size and key size, which are equal, as well as the number of rounds. In addition to the key, it also makes use of an odd modulus n which is small enough to fit in a single block.

The round function is f(m)=(m o a)·b mod n, where a and b are subkeys and b is coprime to n. Here m o a represents an operation that equals m XOR a, if that is less than n, and otherwise equals m. This is a simple invertible operation: m o a o a = m. The xmx cipher consists of an even number of iterations of the round function, followed by a final o with an additional subkey. The key schedule is very simple, using the same key for all the multipliers, and three different subkeys for the others: the key itself for the first half of the cipher, its multiplicative inverse mod n for the last half, and the XOR of these two for the middle subkey.

The designers defined four specific variants of xmx: Standard: 512-bit block size, 8 rounds, n=2 512 -1 High security: 768-bit block size, 12 rounds, n=2 768 -1 Very-high security: 1024-bit block size, 16 rounds, n=2 1024 -1 Challenge: 256-bit block size, 8 rounds, n=(2 80 -1)·2 176 +157 Borisov, et al., using a multiplicative form of differential cryptanalysis, found a complementation property for any variant of xmx, like the first three above, such that n=2 k -1, where k is the block size. They also found large weak key classes for the Challenge variant, and for many other moduli.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1281329527 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.