Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

TMAC: Two-Key CBC MAC

Kaoru KurosawaContact Information and Tetsu IwataContact Information

(5)  Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, 316-8511 Hitachi, Ibaraki, Japan
Abstract
In this paper, we propose TMAC. TMAC is a refinement of XCBC such that it requires only two keys while XCBC requires three keys. More precisely, TMAC requires only (k + n)-bit keys while XCBC requires (k + 2n)-bit keys, where k is the key length of the underlying block cipher E and n is its block length. We achieve this by using a universal hash function and the cost is almost negligible. Similar to XCBC, the domain is 0, 1. and it requires no extra invocation of E even if the size of the message is a multiple of n.

Keywords  CBC MAC - block cipher - provable security


Contact Information Kaoru Kurosawa
Email: kurosawa@cis.ibaraki.ac.jp

Contact Information Tetsu Iwata
Email: iwata@cis.ibaraki.ac.jp
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
2 newer articles

  1. Nandi, Mridul (2008) Improved security analysis of PMAC. Journal of Mathematical Cryptology 2(2)
    [CrossRef]
  2. Bellare, Mihir (2008) Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. Journal of Cryptology
    [CrossRef]
Remote Address: 38.107.191.109 • Server: mpweb03
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)