| an efficient one-key carter-wegman message authentication code | |
| Xu Jin; Wang Dayin; Lin Dongdai; Wu Wenling | |
| 2007 | |
| 会议名称 | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 |
| 会议录名称 | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 |
| 页码 | 1331-1334 |
| 会议日期 | October 3, |
| 会议地点 | Guangzhou, China |
| 收录类别 | EI |
| 出版地 | United States |
| ISBN | 1424406056 |
| 部门归属 | (1) Beijing Electronic Science and Technology Institute, Beijing 100070, China; (2) SKLOIS Lab., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| 摘要 | In this paper, we present an efficient One-Key Carter-Wegman Message Authentication Code, called One-key Galois Message Authentication Code(OGMAC), and prove its security for arbitrary length message. Generally, Carter-Wegman MACs use a universal hash and |
| 关键词 | Binary Sequences Codes (Symbols) Theorem Proving |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/10898 |
| 专题 | 信息安全国家重点实验室 |
| 推荐引用方式 GB/T 7714 | Xu Jin,Wang Dayin,Lin Dongdai,et al. an efficient one-key carter-wegman message authentication code[C]. United States,2007:1331-1334. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| 04076181.pdf（183KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论