高效率强壮消息鉴别码的分析与设计

项目名称： 高效率强壮消息鉴别码的分析与设计

项目编号： No.61202422

项目类型： 青年科学基金项目

立项/批准年度： 2013

项目学科： 计算机科学学科

项目作者： 张立廷

作者单位： 中国科学院软件研究所

项目金额： 23万元

中文摘要： 消息鉴别码是密码学中保护数据完整性和起源认证的重要工具之一，在现实生活中有着广泛的应用。目前，此类算法大多依据伪随机的底层模块设计，它们通常效率较高，但在侧信道攻击下安全性很弱；少数算法依据不可预测的底层模块设计，它们的安全性不依赖于内部链接值的机密性，在侧信道攻击下安全，但效率较低。本项目致力于分析与设计高效率强壮的消息鉴别码算法，一方面保证算法的可证明安全性，并在此基础上不断弱化算法安全性对底层模块的依赖，设计针对侧信道攻击安全的算法；另一方面研究提高现有算法的运行效率，同时发掘当前的新需求设计更适合于现实应用的算法。通过本项目，我们研究消息鉴别码领域各种安全模型的特点及其相互关系，分析算法的结构对其安全性的影响，研究算法底层基础模块的安全性质，并探讨高效率强壮消息鉴别码算法的设计原理。我们力争取得一批有国际影响力的成果，同时推进我国的标准化建设。

中文关键词： 消息鉴别码；超越生日界；分组密码；可证明安全；

英文摘要： Message authentication code (MAC) is one of important tools in cryptography for protecting data integrity and data origin authentication, having wide applications in the world. Currently, most of such algorithms are designed from pseudorandom primitives. They usually offer high efficiency, but suffer from side channel attacks (SCAs). Some other MACs are constructed from unpredictable primitives, with security not relying on the secrecy of chaining values. Therefore, they are provably secure against SCAs. Unfortunately, the latter are few and current solutions run very slowly. In this program, we would try to analyze and design highly-efficient and strong MACs. On the one hand, we will weaken their security reliance on underlying primitives, and design provably secure algorithms against SCAs; on the other hand, we try to discover new practical requirements and improve algorithm efficiency. By this program, we will investigate MAC models and their relationship, analyze MAC security at both structural level and underlying level, and find out the design principle of highly-efficient and strong MACs. We will try to achieve a series of internationally influential results, and motivate our national standardization on MACs.

英文关键词： Message Authentication Code；beyond birthday bound；block cipher；provable security；