论文部分内容阅读
看来很难给公开密钥密码编码学的计算保密下一个正式定义。我们定义一个稍有不同的概念。称为瞬态密钥密码编码学,用它可以给抗选择明文攻击的保密性下一个自然的定义。这里所提出的主要结果是存在相对的计算模型在此模型之下存在可证明是安全的瞬态密钥密码体制。的确存在密码员能够用于有效地加密和解密消息的可计算的外部信息源,但对于密码分析者试图解译不是给他的消息没有任何帮助。作为一个推论,存在一个等长置换,其逆难以对它的定义域中的大多数元素进行计算,甚至允许这个函数本身可以任意求值。
It seems difficult to give the official formality of cryptographic secrecy of public key cryptography. We define a slightly different concept. Known as transient key cryptography, it gives a natural definition of confidentiality against selective plaintext attacks. The main result presented here is that there is a relative computational model under which there exists a transient key cryptosystem that can prove to be secure. There is indeed a computable source of external information that cryptographers can use to efficiently encrypt and decrypt messages, but it does not help the cryptanalyst in trying to interpret messages that are not for him. As a corollary, there is an equal-length permutation, whose inverse difficulty makes it impossible to calculate most elements in its domain, and even allows the function itself to evaluate itself.