Open AccessThe M ARVIN message authentication code and the L ETTER S OUP authenticated encryption scheme
Author(s) -
Simplicio Marcos A.,
Barbuda Pedro d'Aquino F. F. S.,
Barreto Paulo S. L. M.,
Carvalho Tereza C. M. B.,
Margi Cintia B.
Publication year - 2008
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.66
Subject(s) - computer science , authenticated encryption , encryption , block cipher , authentication (law) , message authentication code , code (set theory) , block (permutation group theory) , scheme (mathematics) , computer network , computer security , cryptography , programming language , mathematics , mathematical analysis , geometry , set (abstract data type)
We present M ARVIN , a new parallelizable message authentication code (MAC) based on the ALRED family. The new algorithm is designed with resource‐constrained platforms inmind and explores the structure of an underlying block cipher toprovide security at a small cost in terms of memory needs. Also,we show how M ARVIN can be used as an authentication‐onlyfunction or else in an authenticated encryption with associateddata (AEAD) scheme. We define a new AEAD proposal called L ETTER S OUP , which is based on the mode ofoperation. Finally, we LFSRC analyze the security and performance of theresulting schemes. Copyright © 2008 John Wiley & Sons, Ltd.