• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2015 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems >Reliable hash trees for post-quantum stateless cryptographic hash-based signatures
【24h】

Reliable hash trees for post-quantum stateless cryptographic hash-based signatures

机译：基于Quantum无状态Cryptography哈希签名的可靠哈希树

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

摘要

The potential advent of quantum computers in coming years has motivated security researchers to start developing resistant systems capable of thwarting future attacks, i.e., developing post-quantum cryptographic approaches. Hash-based, code-based, lattice-based, multivariate-quadratic-equations, and secret-key cryptography are all potential candidates, the merit of which is that they are believed to resist both classical and quantum computers and applying “Shor's algorithm”-the quantum-computer discrete-logarithm algorithm that breaks classical schemes-to them is infeasible. In this paper, we propose reliable and error detection hash trees for stateless hash-based signatures which are believed to be one of the prominent post-quantum schemes, offering security proofs relative to plausible properties of the hash function. We note that this work on the emerging area of reliable, error detection post-quantum cryptography, can be extended and scaled to other approaches as well. We also note that the proposed approaches make such schemes more reliable against natural faults and help protecting them against malicious faults. We propose, benchmark, and discuss fault diagnosis methods for this post-quantum cryptography variant choosing a case study for hash functions, and present the simulations and implementations results to show the applicability of the presented schemes. The presented architectures can be tailored for different reliability objectives based on the resources available, and would initiate the new research area of reliable, error detection postquantum cryptographic architectures.
机译：未来几年量子计算机的潜在出现具有激励的安全研究人员，即开始开发能够阻止未来攻击的抗性系统，即开发Quantum Chretpoct方法。基于哈希的基于代码的，基于晶格的，多变量 - 二次方程和秘密密钥加密是所有潜在的候选者，其中的优点是它们被认为抵抗古典和量子计算机并应用“Shor的算法” - 将古典方案中断的量子计算机离散对数算法是不可行的。在本文中，我们为无状态散列的签名提出了可靠和错误的检测哈希树，被认为是突出的后量子计划之一，提供相对于散列函数的合理性质的安全性证明。我们注意到，这对新兴区域可靠，错误检测后量子密码术，也可以扩展到其他方法。我们还注意到，拟议的方法可以对自然故障进行更可靠的方案，并有助于保护他们免受恶意的错。我们提出，基准测试，并讨论该后级密码摄入的故障诊断方法选择散列函数的案例研究，并呈现模拟和实现结果，以显示所提出的方案的适用性。根据可用的资源，可以针对不同的可靠性目标量身定制所呈现的架构，并将启动可靠，错误检测PostQuantum Cryptogal架构的新研究领域。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号