论文信息 - A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm

A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm

We present a term rewrite system that formally models the Message Authenticator Algorithm (MAA), which was one of the first cryptographic functions for computing a Message Authentication Code and was adopted, between 1987 and 2001, in international standards (ISO 8730 and ISO 8731-2) to ensure the authenticity and integrity of banking transactions. Our term rewrite system is large (13 sorts, 18 constructors, 644 non-constructors, and 684 rewrite rules), confluent, and terminating. Implementations in thirteen different languages have been automatically derived from this model and used to validate 200 official test vectors for the MAA.

Hubert Garavel | Lina Marsso

[1] Vincent Rijmen,et al. Key Recovery and Collision Clusters for MAA , 1996 .

[2] Wolfgang Grieskamp,et al. OPAL: Design and Implementation of an Algebraic Programming Language , 1994, Programming Languages and System Architectures.

[3] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[4] Bart Preneel,et al. On the Security of Iterated Message Authentication Codes , 1999, IEEE Trans. Inf. Theory.

[5] Donald W. Davies,et al. A Message Authenticator Algorithm Suitable for A Mainframe Computer , 1985, CRYPTO.

[6] Francisco Durán,et al. The Second Rewrite Engines Competition , 2009, WRLA.

[7] Graeme I. Parkin,et al. Specification of the MAA Standard in VDM , 1991, VDM Europe.

[8] Bart Preneel,et al. Security analysis of the message authenticator algorithm (MAA) , 1997, Eur. Trans. Telecommun..

[9] Jürgen Giesl,et al. Proving Termination of Programs Automatically with AProVE , 2014, IJCAR.

[10] Hubert Garavel,et al. Compilation of LOTOS Abstract Data Types , 1989, FORTE.

[11] Bart Preneel,et al. On the Security of Two MAC Algorithms , 1996, EUROCRYPT.

[12] Francisco Durán,et al. The Third Rewrite Engines Competition , 2010, WRLA.