Message Authenticator Algorithm

The Message Authenticator Algorithm (MAA) was one of the first cryptographic functions for computing a message authentication code (MAC). It was designed in 1983 by Donald Davies and David Clayden at the National Physical Laboratory (United Kingdom) in response to a request of the UK Bankers Automated Clearing Services. The MAA was one of the first Message Authentication Code algorithms to gain widespread acceptance.

## Contents

* 1 Development and standardization
* 2 Attacks
* 3 Formal specifications of the MAA
* 4 References
* 5 External links

## Development and standardization

The original specification[1][2] of the MAA was given in a combination of natural language and tables, complemented by two implementations in C and BASIC programming languages.

The MAA was adopted by ISO in 1987 and became part of international standards ISO 8730[3][4] and ISO 8731-2[5] intended to secure the authenticity and integrity of banking transactions.

## Attacks

Later, cryptanalysis of MAA revealed various weaknesses, including feasible brute-force attacks, existence of collision clusters, and key-recovery techniques.[6][7][8][9] For this reason, MAA was withdrawn from ISO standards in 2002 but continued to be used as a prominent case study for assessing various formal methods.[10]

## Formal specifications of the MAA

The MAA has been used as a prominent case study for assessing various formal methods.

In the early 1990s, the NPL developed three formal specifications of the MAA: one in Z,[11] one in LOTOS,[12] and one in VDM.[13][14] The VDM specification became part of the 1992 revision of the International Standard 8731-2, and three implementations were manually derived from that latter specification: C, Miranda, and Modula-2.[15]

Other formal models of the MAA have been developed. In 2017, a complete formal specification of the MAA as a large term rewriting system was published;[16] From this specification, implementations of the MAA in fifteen different languages have been generated automatically. In 2018, two new formal specifications of the MAA, in LOTOS and LNT, have been published.[17]

## References

1. ↑ Davies, Donald W. (1985). "A Message Authenticator Algorithm Suitable for a Mainframe Computer". 196. Springer. pp. 393–400. doi:10.1007/3-540-39568-7_30.
2. ↑ Davies, Donald W.; Clayden, David O. (1988). ﻿The Message Authenticator Algorithm (MAA) and its Implementation﻿ (NPL Report DITC 109/88). Teddington, Middlesex, UK. http://www.cix.co.uk/~klockstone/maa.pdf.
3. ↑ International Organization for Standardization (1987). ﻿International Standard 8731-2. Approved Algorithms for Message Authentication – Part 2: Message Authenticator Algorithm (MAA)﻿ (Report). Geneva.
4. ↑ International Organization for Standardization (1992). ﻿International Standard 8731-2. Approved Algorithms for Message Authentication – Part 2: Message Authenticator Algorithm (MAA)﻿ (Report). Geneva.
5. ↑ International Organization for Standardization (1990). ﻿International Standard 8730. Requirements for Message Authentication (Wholesale)﻿ (Report). Geneva.
6. ↑ Preneel, Bart; van Oorschot, Paul C. (1996). "On the Security of Two MAC Algorithms". Advances in Cryptology – Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT’96), Saragossa, Spain. 1070. Springer. pp. 19–32. doi:10.1007/3-540-68339-9_3.
7. ↑ Preneel, Bart; van Oorschot, Paul C. (1999). "On the Security of Iterated Message Authentication Codes". IEEE Transactions on Information Theory 45 (1): 188–199. doi:10.1109/18.746787.
8. ↑ Preneel, Bart; Rumen, Vincent; van Oorschot, Paul C. (1997). Security Analysis of the Message Authenticator Algorithm (MAA) -journal=European Transactions on Telecommunications. 8. pp. 455–470. doi:10.1002/ett.4460080504.
9. ↑ Rijmen, Vincent; Preneel, Bart; De Win, Erik (1996). "Key Recovery and Collision Clusters for MAA". Proceedings of the 1st International Conference on Security in Communication Networks (SCN’96). https://www.cosic.esat.kuleuven.be/publications/article-437.pdf.
10. ↑ Preneel, Bart (2011). "MAA". Encyclopedia of Cryptography and Security. Encyclopedia of Cryptography and Security. pp. 741–742. doi:10.1007/978-1-4419-5906-5_591. ISBN 978-1-4419-5905-8. https://link.springer.com/referenceworkentry/10.1007/978-1-4419-5906-5_591. Retrieved 3 May 2021.
11. ↑ M. K. F. Lai (1991). ﻿A Formal Interpretation of the MAA Standard in Z﻿ (NPL Report DITC 184/91). Teddington, Middlesex, UK.
12. ↑ Harold B. Munster (1991). ﻿LOTOS Specification of the MAA Standard, with an Evaluation of LOTOS﻿ (NPL Report DITC 191/91). Teddington, Middlesex, UK. ftp://ftp.inrialpes.fr/pub/vasy/publications/others/Munster-91-a.pdf.
13. ↑ Graeme I. Parkin; G. O’Neill (1990). ﻿Specification of the MAA Standard in VDM﻿ (NPL Report DITC 160/90).
14. ↑ Graeme I. Parkin; G. O’Neill (1991). "Specification of the MAA Standard in VDM". Formal Software Development – Proceedings (Volume 1) of the 4th International Symposium of VDM Europe (VDM’91), Noordwijkerhout, The Netherlands. 551. Springer. pp. 526–544. doi:10.1007/3-540-54834-3_31.
15. ↑ R. P. Lampard (1991). ﻿An Implementation of MAA from a VDM Specification﻿ (NPL Technical Memorandum DITC 50/91). Teddington, Middlesex, UK.
16. ↑ Garavel, Hubert; Marsso, Lina (2017). "A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm". Proceedings of the 2nd Workshop on Models for Formal Analysis of Real Systems (MARS'17), Uppsala, Sweden. 244. pp. 129–183. doi:10.4204/EPTCS.244.6. http://cadp.inria.fr/publications/Garavel-Marsso-17.html.
17. ↑ Garavel, Hubert; Marsso, Lina (2018). "Comparative Study of Eight Formal Specifications of the Message Authenticator Algorithm". Proceedings of the 3nd Workshop on Models for Formal Analysis of Real Systems (MARS'18) and 6th International Workshop on Verification and Program Transformation (MARS/VPT 2018), Thessaloniki, Greece. 268. pp. 41–87. doi:10.4204/EPTCS.268.2. http://cadp.inria.fr/publications/Garavel-Marsso-18.html.

## External links

* Preneel, Bart (2011). "MAA". Encyclopedia of Cryptography and Security (2nd ed.). Springer. pp. 741–742. doi:10.1007/978-1-4419-5906-5_591. ISBN 978-1-4419-5905-8.
* http://www.cix.co.uk/~klockstone/maa.htm
* http://www.mars-workshop.org/repository/012-MAA.html

* v
* t
* e

Cryptographic hash functions & message authentication codes

* List
* Comparison
* Known attacks

Common functions|

* MD5
* SHA-1
* SHA-2
* SHA-3
* BLAKE2

SHA-3 finalists|

* BLAKE
* Grøstl
* JH
* Skein
* Keccak (winner)

Other functions|

* CubeHash
* ECOH
* FSB
* GOST
* HAS-160
* HAVAL
* Kupyna
* LM hash
* MD2
* MD4
* MD6
* MDC-2
* N-Hash
* RIPEMD
* RadioGatún
* SM3
* SWIFFT
* Snefru
* Streebog
* Tiger
* VSH
* Whirlpool

Key derivation functions|

* Argon2
* Balloon
* bcrypt
* crypt
* Lyra2
* PBKDF2
* scrypt

MAC functions|

* DAA
* CBC-MAC
* GMAC
* HMAC
* NMAC
* OMAC/CMAC
* PMAC
* VMAC
* UMAC
* Poly1305
* SipHash

Authenticated
encryption modes|

* CCM
* CWC
* EAX
* GCM
* IAPM
* OCB

Attacks|

* Collision attack
* Preimage attack
* Birthday attack
* Brute-force attack
* Rainbow table
* Side-channel attack
* Length extension attack

Design|

* Avalanche effect
* Hash collision
* Merkle–Damgård construction
* Sponge function
* HAIFA construction

Standardization|

* CRYPTREC
* NESSIE
* NIST hash function competition

Utilization|

* Hash-based cryptography
* Key stretching
* Merkle tree
* Message authentication
* Proof of work
* Salt
* Pepper

* v
* t
* e

Cryptography

* History of cryptography
* Cryptanalysis
* Outline of cryptography

* Symmetric-key algorithm
* Block cipher
* Stream cipher
* Public-key cryptography
* Cryptographic hash function
* Message authentication code
* Random numbers
* Steganography

* Category

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Message Authenticator Algorithm. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Message_Authenticator_Algorithm&oldid=2226237"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template