首页> 外文会议>International Conference on Advances in Information Security and Its Applications >A New Double-Block-Length Hash Function Using Feistel Structure
【24h】

A New Double-Block-Length Hash Function Using Feistel Structure

机译:一种新的双块长度散列函数,使用Feistel结构

获取原文

摘要

We propose new double-block-length hash functions. Our approach for constructing collision-resistant double-block-length hash functions is to convert a blockcipher E with n-bit block length and 2n-bit key length to a 3-round Feistel cipher E~* with 2n-bit block length, and then to embed E~* in PGV compression functions. We prove that 12 hash functions with the group-1 PGV compression functions in which E~* is embedded are collision-resistant in the ideal cipher model. Furthermore, since our hash functions have the hash rate 2/3, they are more efficient than any other existing double-block-length hash functions in terms of the number of blockcipher calls required for processing messages.
机译:我们提出了新的双块长度散列函数。我们用于构造抗冲击双块长度散列函数的方法是将具有N位块长度的块连接和2n位键长度转换为具有2n位块长度的3轮Feistel密码E〜*,以及然后在PGV压缩功能中嵌入E〜*。我们证明了12个哈希函数,其中嵌入了E〜*的G组 - 1 PGV压缩函数,在理想的密码模型中是抗冲击的抗冲击。此外,由于我们的散列函数具有2/3的哈希速率,因此在处理消息所需的BlockCipher呼叫数量方面,它们比任何其他现有双块长度散列更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号