\(\mathsf{xmx}\): a firmware-oriented block cipher based on modular multiplications. (English) Zbl 1385.94059

Biham, Eli (ed.), Fast software encryption. 4th international workshop, FSE ’97, Haifa, Israel, January 20–22, 1997. Proceedings. Berlin: Springer (ISBN 3-540-63247-6). Lect. Notes Comput. Sci. 1267, 166-171 (1997).
Summary: This paper presents \mathsf{xmx}, a new symmetric block cipher optimized for public-key libraries and microcontrollers with arithmetic co-processors. \mathsf{xmx} has no S-boxes and uses only modular multiplications and xors. The complete scheme can be described by a couple of compact formulae that offer several interesting time-space trade-offs (number of rounds/key-size for constant security).
In practice, \mathsf{xmx} appears to be tiny and fast:136 code bytes and a 121 kilo-bits/second throughput on a Siemens SLE44CR80s smart-card (5 MHz oscillator).
For the entire collection see [Zbl 0901.68004].


94A60 Cryptography


Full Text: DOI


[1] 1.F. Chabaud and R. Lercier, \(The ZEN library\), http://lix.polytechnique.fr/ zen/
[2] 2.FIPS PUB 46, 1977, \(Data Encryption Standard\).
[3] 3.P. Kocher, \(Timing attacks in implementations of Diffie-Hellman, RSA, DSS and other systems\), Advances in Cryptology — CRYPTO ’96, LNCS 1109, 1996, pp. 104-113. · Zbl 1329.94070
[4] 4.J. Massey, \(SAFER K-64: a byte oriented block cipher algorithm\), Fast Software Encryption, Cambridge Security Workshop, 1993, LNCS 809, pp. 1-17. · Zbl 0943.94536
[5] 5.D. Naccache and D. M’RaÏhi, \(Cryptographic smart cards\), IEEE Micro, June 1996, vol. 16, no. 3, pp. 14-23.
[6] 6.P. van Oorschot and M. J. Wiener, \(Parallel collision search with application to hash functions and discrete logarithms\), 2\^{}{nd} ACM Conference on Computer and Communication Security, Fairfax, Virginia, ACM Press, 1994, pp. 210-218.
[7] 7.J-J. Quisquater and J-P. Delescaille, \(How easy is collision search? Application to DES\), Advances in Cryptology — EUROCRYPT’89, LNCS 434, 1990, pp. 429-434.
[8] 8.B. Serpette, J. Vuillemenin and J. C. Hervé, \(BIGNUM: a portable and efficient package for arbitrary-precision arithmetic\), PRL Research Report #2, 1989, ftp://ftp.digital.com/pub/DEC/PRL/research-reports/PRL-RR-2.ps.Z.
[9] 9.D. J. Wheeler and R. M. Needham, \(TEA, a tiny encryption algorithm\), Fast Software Encryption, Leuven, LNCS 1008, 1994, pp. 363-366.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.