首页> 外国专利> Equivocation augmentation dynamic secrecy system

Equivocation augmentation dynamic secrecy system

机译:模糊增强动态保密系统

摘要

Shannon's equivocation, the conditional entropy of key or message with respect to a specific ciphertext, is the primary indicator of the security of any secrecy system, in that when key equivocation H E (K) or message equivocation H E (M) attain log 0 (or 1) under a brute-force attack, the system is compromised and has no security. We propose a simplistic equivocation definition of security which distinguishes between “secure/unsolvable” and “insecure/solvable” encipherments. Whilst equivocation may be used practically in a passive manner to cryptanalyse finite-length key “insecure/solvable” secrecy systems to determine the length of ciphertext required to compromise the secrecy system, the invention in this patent offers a cryptographic design framework which allows for the equivocation of finite-length key systems to be actively engineered using equivocation augmentation, such that the residual key and message equivocation of any cryptosystem may be continuously augmented at a faster rate than it is lost, effectively ensuring that equivocation can never attain log 0. In short, it allows for the encryption of any length of message with any finite length key into a ciphertext with “secure/unsolvable” security characteristics. Alternatively, it allows for the cryptographic engineering of information theoretic security in all finite length key systems. The invention is primarily aimed at solving two major problems: (a) a viable practical security solution against future quantum computing/artificial intelligence threats (the QC/AI problem), and (b) a viable practical security solution to the privacy/national interest dichotomy problem, in that it allows for the engineering of security systems which are capable of simultaneously supporting both the absolute privacy of individual users and the security interests of the user group at large. Various methods, apparatuses, and systems are described which allow for the implementation of a “secure/unsolvable” secrecy system which is fast, extensible, simple to implement in hardware and software, and able to be incorporated by or with any existing security solution or cryptographic primitives.
机译:香农的模棱两可,即密钥或消息相对于特定密文的条件熵,是任何保密系统安全性的主要指标,因为当密钥模棱两可的HE(K)或消息模棱两可的HE(M)达到log 0(或1)在强力攻击下,系统受到威胁,并且没有安全性。我们提出了一种简单的安全模棱两可的定义,该定义将“安全/无法解决”和“安全/无法解决”的加密区别开来。虽然实际上可以以被动方式使用模棱两可来对有限长度密钥“不安全/可解决”的保密系统进行密码分析,以确定损害该保密系统所需的密文长度,但该专利中的发明提供了一种密码设计框架,该框架允许要使用等义增强来主动设计的有限长度密钥系统的等义化,以便可以以比丢失速度更快的速率连续增强任何密码系统的剩余密钥和消息等值化,从而有效地确保等式永远不会达到log 0。简而言之,它允许使用任何有限长度的密钥将任何长度的消息加密为具有“安全/无法解决”安全特征的密文。或者,它允许在所有有限长度的密钥系统中对信息理论安全性进行加密工程。本发明主要旨在解决两个主要问题:(a)针对未来的量子计算/人工智能威胁(QC / AI问题)的可行的实用安全解决方案,以及(b)针对隐私/国家利益的可行的实用安全解决方案。二分法问题,因为它允许设计安全系统,该系统能够同时支持单个用户的绝对隐私和整个用户组的安全利益。描述了允许实现“安全/不可解决的”保密系统的各种方法,装置和系统,该系统快速,可扩展,易于在硬件和软件中实施,并且能够与任何现有的安全解决方案或密码原语。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号