References

  1. David Champelovier, Xavier Clerc, Hubert Garavel, Yves Guerte, Christine McKinty, Vincent Powazny, Frédéric Lang, Wendelin Serwe & Gideon Smeding (2017): Reference Manual of the LNT to LOTOS Translator (Version 6.7). Available at http://cadp.inria.fr/publications/Champelovier-Clerc-Garavel-et-al-10.html. INRIA/VASY and INRIA/CONVECS, 130 pages.
  2. Donald W. Davies (1985): A Message Authenticator Algorithm Suitable for a Mainframe Computer. In: G. R. Blakley & David Chaum: Advances in Cryptology – Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (CRYPTO'84), Santa Barbara, CA, USA, Lecture Notes in Computer Science 196. Springer, pp. 393–400, doi:10.1007/3-540-39568-7_30.
  3. Donald W. Davies & David O. Clayden (1983): A Message Authenticator Algorithm Suitable for a Mainframe Computer. NPL Report DITC 17/83. National Physical Laboratory, Teddington, Middlesex, UK.
  4. Donald W. Davies & David O. Clayden (1988): The Message Authenticator Algorithm (MAA) and its Implementation. NPL Report DITC 109/88. National Physical Laboratory, Teddington, Middlesex, UK. Available at http://www.cix.co.uk/~klockstone/maa.pdf.
  5. Francisco Durán, Manuel Roldán, Jean-Christophe Bach, Emilie Balland, Mark van den Brand, James R. Cordy, Steven Eker, Luc Engelen, Maartje de Jonge, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau & Eelco Visser (2010): The Third Rewrite Engines Competition. In: Peter Csaba Ölveczky: Proceedings of the 8th International Workshop on Rewriting Logic and Its Applications (WRLA'10), Paphos, Cyprus, Lecture Notes in Computer Science 6381. Springer, pp. 243–261, doi:10.1007/978-3-642-16310-4_16.
  6. Francisco Durán, Manuel Roldán, Emilie Balland, Mark van den Brand, Steven Eker, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau, Ruslan Schevchenko & Eelco Visser (2009): The Second Rewrite Engines Competition. Electronic Notes in Theoretical Computer Science 238(3), pp. 281–291, doi:10.1016/j.entcs.2009.05.025.
  7. Hartmut Ehrig & Bernd Mahr (1985): Fundamentals of Algebraic Specification 1 – Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science 6. Springer, doi:10.1007/978-3-642-69962-7.
  8. Hubert Garavel (1989): Compilation of LOTOS Abstract Data Types. In: Son T. Vuong: Proceedings of the 2nd International Conference on Formal Description Techniques FORTE'89 (Vancouver B.C., Canada). North-Holland, pp. 147–162. Available at http://cadp.inria.fr/publications/Garavel-89-c.html.
  9. Hubert Garavel (2015): Revisiting Sequential Composition in Process Calculi. Journal of Logical and Algebraic Methods in Programming 84(6), pp. 742–762, doi:10.1016/j.jlamp.2015.08.001.
  10. Hubert Garavel, Frédéric Lang, Radu Mateescu & Wendelin Serwe (2013): CADP 2011: A Toolbox for the Construction and Analysis of Distributed Processes. Springer International Journal on Software Tools for Technology Transfer (STTT) 15(2), pp. 89–107, doi:10.1007/s10009-012-0244-z. Available at http://cadp.inria.fr/publications/Garavel-Lang-Mateescu-Serwe-13.html.
  11. Hubert Garavel, Frédéric Lang & Wendelin Serwe (2017): From LOTOS to LNT. In: Joost-Pieter Katoen, Rom Langerak & Arend Rensink: ModelEd, TestEd, TrustEd – Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 10500. Springer, pp. 3–26, doi:10.1007/978-3-319-68270-9_1.
  12. Hubert Garavel & Lina Marsso (2017): A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm. In: Holger Hermanns & Peter Höfner: Proceedings of the 2nd Workshop on Models for Formal Analysis of Real Systems (MARS'17), Uppsala, Sweden, Electronic Proceedings in Theoretical Computer Science 244, pp. 129–183, doi:10.4204/EPTCS.244.6.
  13. Hubert Garavel & Philippe Turlier (1993): CÆSAR.ADT : un compilateur pour les types abstraits algébriques du langage LOTOS. In: Rachida Dssouli & Gregor v. Bochmann: Actes du Colloque Francophone pour l'Ingénierie des Protocoles (CFIP'93), Montréal, Canada. Hermès, Paris, pp. 325–339. Available at http://cadp.inria.fr/publications/Garavel-Turlier-93.html.
  14. ISO (1986): Requirements for Message Authentication (Wholesale). International Standard 8730. International Organization for Standardization – Banking, Geneva.
  15. ISO (1987): Approved Algorithms for Message Authentication – Part 2: Message Authenticator Algorithm (MAA). International Standard 8731-2. International Organization for Standardization – Banking, Geneva.
  16. ISO (1990): Requirements for Message Authentication (Wholesale). International Standard 8730. International Organization for Standardization – Banking, Geneva.
  17. ISO (1992): Approved Algorithms for Message Authentication – Part 2: Message Authenticator Algorithm. International Standard 8731-2. International Organization for Standardization – Banking, Geneva.
  18. ISO (1999): Requirements for Message Authentication (Wholesale). Technical Corrigendum 1 8730. International Organization for Standardization – Banking, Geneva.
  19. ISO/IEC (1989): LOTOS – A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807. International Organization for Standardization – Information Processing Systems – Open Systems Interconnection, Geneva.
  20. M. K. F. Lai (1991): A Formal Interpretation of the MAA Standard in Z. NPL Report DITC 184/91. National Physical Laboratory, Teddington, Middlesex, UK.
  21. R. P. Lampard (1991): An Implementation of MAA from a VDM Specification. NPL Technical Memorandum DITC 50/91. National Physical Laboratory, Teddington, Middlesex, UK.
  22. Jan de Meer, Rudolf Roth & Son Vuong (1992): Introduction to Algebraic Specifications Based on the Language ACT ONE. Computer Networks and ISDN Systems 23(5), pp. 363–392, doi:10.1016/0169-7552(92)90013-G.
  23. Alfred Menezes, Paul C. van Oorschot & Scott A. Vanstone (1996): Handbook of Applied Cryptography. CRC Press, doi:10.1201/9781439821916. Available at http://cacr.uwaterloo.ca/hac.
  24. Harold B. Munster (1991): LOTOS Specification of the MAA Standard, with an Evaluation of LOTOS. NPL Report DITC 191/91. National Physical Laboratory, Teddington, Middlesex, UK. Available at ftp://ftp.inrialpes.fr/pub/vasy/publications/others/Munster-91-a.pdf.
  25. Graeme I. Parkin & G. O'Neill (1990): Specification of the MAA Standard in VDM. NPL Report DITC 160/90. National Physical Laboratory, Teddington, Middlesex, UK.
  26. Graeme I. Parkin & G. O'Neill (1991): Specification of the MAA Standard in VDM. In: Søren Prehn & W. J. Toetenel: Formal Software Development – Proceedings (Volume 1) of the 4th International Symposium of VDM Europe (VDM'91), Noordwijkerhout, The Netherlands, Lecture Notes in Computer Science 551. Springer, pp. 526–544, doi:10.1007/3-540-54834-3_31.
  27. Bart Preneel (1997): Cryptanalysis of Message Authentication Codes. In: Eiji Okamoto, George I. Davida & Masahiro Mambo: Proceedings of the 1st International Workshop on Information Security (ISW'97), Tatsunokuchi, Japan, Lecture Notes in Computer Science 1396. Springer, pp. 55–65, doi:10.1007/BFb0030408. Available at http://www.cosic.esat.kuleuven.be/publications/article-61.pdf.
  28. Bart Preneel (2011): MAA. In: Henk C. A. van Tilborg & Sushil Jajodia: Encyclopedia of Cryptography and Security (2nd Edition). Springer, pp. 741–742, doi:10.1007/978-1-4419-5906-5_591.
  29. Bart Preneel & Paul C. van Oorschot (1995): MDx-MAC and Building Fast MACs from Hash Functions. In: Don Coppersmith: Advances in Cryptology – Proceedings of 15th Annual International Cryptology Conference (CRYPTO'95), Santa Barbara, CA, USA, Lecture Notes in Computer Science 963. Springer, pp. 1–14, doi:10.1007/3-540-44750-4_1. Available at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.490.8595&rep=rep1&type=pdf.
  30. Bart Preneel & Paul C. van Oorschot (1996): On the Security of Two MAC Algorithms. In: Ueli M. Maurer: Advances in Cryptology – Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'96), Saragossa, Spain, Lecture Notes in Computer Science 1070. Springer, pp. 19–32, doi:10.1007/3-540-68339-9_3.
  31. Bart Preneel & Paul C. van Oorschot (1999): On the Security of Iterated Message Authentication Codes. IEEE Transactions on Information Theory 45(1), pp. 188–199, doi:10.1109/18.746787.
  32. Bart Preneel, Vincent Rumen & Paul C. van Oorschot (1997): Security Analysis of the Message Authenticator Algorithm (MAA). European Transactions on Telecommunications 8(5), pp. 455–470, doi:10.1002/ett.4460080504.
  33. Vincent Rijmen, Bart Preneel & Erik De Win (1996): Key Recovery and Collision Clusters for MAA. In: Proceedings of the 1st International Conference on Security in Communication Networks (SCN'96). Available at https://www.cosic.esat.kuleuven.be/publications/article-437.pdf.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org