A parallelizable message authentication code

作者：Wang Da Yin^*; Lin Dong Dai; Wu Wen Ling

来源：Journal of Software, 2007, 18(7): 1756-1764.

DOI：10.1360/jos181756

• Adversary forgery probability
• Bit length
• Block cipher
• Deterministic parallelizable message authentication code
• DPMAC
• Game playing
• Provable security
• Pseudo random permutation

This paper defines and analyzes a fully deterministic parallelizable block-cipher mode of operation for message authentication-DPMAC (deterministic parallelizable message authentication code). DPMAC is constructed based on a 128-bit block cipher, works for strings of any bit length, and employs a single block-cipher key. Its security is proved, using the Game-Playing technique to quantify an adversary';s forgery probability in terms of the quality of the block cipher as a pseudo-random permutation.

• 出版日期2007