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 |
会议日期 | October 3, |
会议地点 | Guangzhou, China |
关键词 | Binary sequences Codes (symbols) Theorem proving |
页码 | 1331-1334 |
英文摘要 | 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 |
收录类别 | EI |
会议录 | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
![]() |
会议录出版地 | United States |
ISBN号 | 1424406056 |
内容类型 | 会议论文 |
源URL | [http://124.16.136.157/handle/311060/10898] ![]() |
专题 | 软件研究所_信息安全国家重点实验室_会议论文 |
推荐引用方式 GB/T 7714 | Xu Jin,Wang Dayin,Lin Dongdai,et al. an efficient one-key carter-wegman message authentication code[C]. 见:2006 International Conference on Computational Intelligence and Security, ICCIAS 2006. Guangzhou, China. October 3,. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论