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.
No takes yet. Share an insight, caveat, or question.
Simplício et al. (2008) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: