一种DPMAC消息认证算法
首发时间:2007-12-14
摘要:本文所提出的DPMAC(deterministic parallelizable message authentication code)是一种确定性的可并行的算法。它基于分组长度为128-bit的分组密码来构造。使用一个密钥,可以处理任意长度的消息。在底层分组密码是伪随机置换的假设下,使用Game-Playing技术量化了攻击者成功伪造的概率,从而证明了其安全性。
For information in English, please click here
A DPMAC Message Authentication Algorithm
Abstract:This paper proposed by the DPMAC (deterministic parallelizable message authentication code) is a deterministic algorithm can be parallel. 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.
Keywords: message authentication code pseudo-random permutation provable security
基金:
论文图表:
引用
No.1695813777811976****
同行评议
共计0人参与
勘误表
一种DPMAC消息认证算法
评论
全部评论0/1000