EMAC: Efficient Message Authentication Computing

S. Sunitha · 2015

Many applications rely on the existence of small devices that can exchange information and form communication networks. Preserving the integrity of messages exchanged over public channels is one of the classic goals in cryptography and the literature is rich with message authentication code (MAC) algorithms that are designed for the sole purpose preserving message integrity. With today’s technology,. A new technique for authenticating short encrypted messages is proposed in MAC. MACs based on universal hashing are known to be more computationally efficient than MACs based on block ciphers and cryptographic hash function. In computationally secure MACs, keys can be used to authenticate an arbitrary number of messages . That is after ageering on a key legitimate users can exchange number of authenticated messages with the same key

Read the paper · More papers on PaperTik