A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm

Hubert Garavel 1 Lina Marsso 1
1 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Document type :
Conference papers
2nd Workshop on Models for Formal Analysis of Real Systems, Apr 2017, Uppsala, Sweden. 244, pp.129 - 183, 2017, <http://mars-workshop.org/mars2017/>. <10.4204/EPTCS.244.6>
Liste complète des métadonnées


https://hal.inria.fr/hal-01511859
Contributor : Hubert Garavel <>
Submitted on : Friday, April 21, 2017 - 4:45:46 PM
Last modification on : Thursday, June 15, 2017 - 9:09:27 AM

File

Garavel-Marsso-17.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Hubert Garavel, Lina Marsso. A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm. 2nd Workshop on Models for Formal Analysis of Real Systems, Apr 2017, Uppsala, Sweden. 244, pp.129 - 183, 2017, <http://mars-workshop.org/mars2017/>. <10.4204/EPTCS.244.6>. <hal-01511859>

Share

Metrics

Record views

201

Document downloads

31