Message Authenticator Algorithm

Description: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 ISO 8730 and ISO 8731-2
Author(s):Hubert Garavel, Lina Marsso
Tool(s): REC tool, AProVE tool, Clean, Haskell, LNT (CADP), LOTOS (CADP), Maude, mCRL2, OCaml, Opal, Rascal, Scala, Standard ML, Stratego/XT, Tom
Event:MARS'17
Paper:A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm

Abstract

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.

Model(s)

Creative Commons License    This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.