Institutional Repository
| an efficient one-key carter-wegman message authentication code | |
| Xu Jin; Wang Dayin; Lin Dongdai; Wu Wenling | |
| 2007 | |
| Conference Name | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 |
| Source | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 |
| Pages | 1331-1334 |
| Conference Date | October 3, |
| Conference Place | Guangzhou, China |
| Indexed Type | EI |
| Publish Place | United States |
| ISBN | 1424406056 |
| Department | (1) Beijing Electronic Science and Technology Institute, Beijing 100070, China; (2) SKLOIS Lab., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| English Abstract | 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 |
| Keyword | Binary Sequences Codes (Symbols) Theorem Proving |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10898 |
| Collection | 信息安全国家重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 04076181.pdf（183KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment