• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Cryptology and Information Security in Latin America >Optimally Indifferentiable Double-Block-Length Hashing Without Post-processing and with Support for Longer Key Than Single Block
【24h】

Optimally Indifferentiable Double-Block-Length Hashing Without Post-processing and with Support for Longer Key Than Single Block

机译：最佳不可区分的双块长度散列，无需后处理，并且支持比单个块更长的密钥

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Existing double-block-length (DBL) hash functions, in order to achieve optimal indifferentiable security (security up to O(2~n) query complexity), require a block cipher with n-bit blocks and k-bit keys such that 2n ≤ k, and a post-processing function with two block cipher calls. In this paper, we consider the indifferentiability of MDPH, a combination of the MDP domain extender and Hirose's compression function. MDPH does not require the post-processing function (thus has better efficiency), and supports block ciphers with n < k. We show that MDPH achieves (nearly) optimal indifferentiable security. To the best of our knowledge, this is the first result for DBL hashing with optimal indifferentiable security, with support for block ciphers with n < k, and without the post-processing function.
机译：为了获得最佳的不可区分的安全性（高达O（2〜n）查询复杂度的安全性），现有的双块长度（DBL）哈希函数需要具有n位块和k位密钥的块密码，使得2n ≤k，以及具有两个块密码调用的后处理函数。在本文中，我们考虑了MDPH的不可分性，它是MDP域扩展程序和Hirose压缩函数的组合。 MDPH不需要后处理功能（因此效率更高），并且支持n

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号