首页> 外文期刊>Quantum Engineering >Quantum algorithms for hash preimage attacks
【24h】

Quantum algorithms for hash preimage attacks

机译:量子算法散列像原攻击

获取原文
获取原文并翻译 | 示例
           

摘要

Summary Cryptographic hash functions are important building blocks of many security systems. A preimage attack on hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks on its preimage. The current paper presents a new quantum algorithm for hash preimage attacks, which can break the preimage resistance with circuit complexity O (2 n /3 ) using O (2 n /3 ) running times, where n is the input bit length of the hash function. The quantum circuit complexity is apparently reduced from O (2 n /2 ) to O (2 n /3 ) at the cost of O (2 n /3 ) running times requirements compared with the existing algorithms.
机译:xml: id = " que236 - abs - 0001 " > 摘要密码哈希函数的重要基石许多安全系统。试图找到消息的功能特定的散列值。函数应该抵制攻击它的逆象。目前提出了一种新的量子哈希算法原象攻击,可以打破原像电阻电路共舞)运行时间, n 是输入长度的哈希函数。量子电路复杂度明显降低共舞)运行时间与需求现有的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号