首页> 外文会议>USENIX Security Symposium >Halting Password Puzzles Hard-to-break Encryption from Human-memorable Keys
【24h】

Halting Password Puzzles Hard-to-break Encryption from Human-memorable Keys

机译:暂停密码拼图从人类难忘的键难以打破加密

获取原文

摘要

We revisit the venerable question of "pure password"-based key derivation and encryption, and expose security weaknesses in current implementations that stem from structural flaws in Key Derivation Functions (KDF). We advocate a fresh redesign, named Halting KDF (HKDF), which we thoroughly motivate on these grounds: 1. By letting password owners choose the hash iteration count, we gain operational flexibility and eliminate the rapid obsolescence faced by many existing schemes. 2. By throwing a Halting-Problem wrench in the works of guessing that iteration count, we widen the security gap with any attacker to its theoretical optimum. 3. By parallelizing the key derivation, we let legitimate users exploit all the computational power they can muster, which in turn further raises the bar for attackers. HKDFs are practical and universal: they work with any password, any hardware, and a minor change to the user interface. As a demonstration, we offer real-world implementations for the TrueCrypt and GnuPG packages, and discuss their security benefits in concrete terms.
机译:我们重新审视“纯密码”的尊重问题 - 基于“基于密钥导出和加密,并在关键推导函数(KDF)中源于结构漏洞的当前实现中的安全弱点。我们主张新的重新设计,命名为暂停KDF(HKDF),我们彻底激励了这些理由:1。通过让密码所有者选择散列迭代计数,我们获得运行灵活性,消除许多现有方案所面临的快速过时。 2.通过在猜测迭代计数的作品中抛出暂停问题扳手,我们将任何攻击者扩大到其理论上的安全差距。 3.通过并行化关键推导,我们让合法用户利用他们可以集合的所有计算能力,从而进一步提高了攻击者的酒吧。 HKDFS实用且通用:它们与任何密码,任何硬件以及对用户界面的次要更改工作。作为演示,我们为TrueCrypt和Gnupg软件包提供了现实世界的实现,并以具体的方式讨论其安全福利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号