| 本文已被：浏览 5655次 下载 6527次 |
码上扫一扫！ |
|
|
| 一种可并行的消息认证码 |
|
王大印1,2, 林东岱1, 吴文玲1
|
|
1.中国科学院,软件研究所,信息安全国家重点实验室,北京,100080;2.中国科学院,研究生院,北京,100049
|
|
| 摘要: |
| 提出并分析了一种确定的、可并行的消息认证码--DPMAC(deterministic parallelizable message authentication code).它基于分组长度为128-bit的分组密码来构造.使用一个密钥,可以处理任意长度的消息.在底层分组密码是伪随机置换的假设下,使用Game-Playing技术量化了攻击者成功伪造的概率,从而证明了其安全性. |
| 关键词: 消息认证码 伪随机置换 可证明安全 Game-Playing |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60373048, 90604036 (国家自然科学基金); the National Basic Research Program of China under Grant No.2004CB318004 (国家重点基础研究发展计划(973)) |
|
| A Parallelizable Message Authentication Code |
|
WANG Da-Yin,LIN Dong-Dai,WU Wen-Ling
|
| Abstract: |
| 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. |
| Key words: message authentication code pseudo-random permutation provable security Game-Playing |
