论文部分内容阅读
我们提出一种加密方法,它有这种奇异的特点:公开披露加密密钥不会暴露相应的解密密钥。这有两个重要的结果: (1)传递密钥不需要信使或其他隐蔽手段,因为消息可以用予定的接收者公开披露的加密密钥加密。只有他能够解出这种消息,因为只有他知道相应的解密密钥。 (2)消息可以用密藏的解密密钥被签上名。任何人都可以用相应的公开披露的加密密钥验证这一签名;签名不能伪造;签名者也不能在此后否认他的签名的真实性。这在“电子邮寄”和“电子汇款”系统中有明显的用途。消息可以这样加密:把它表示为一个数M,把M自乘升幂至某公开指定的方幂e,用公开指定的n——它是两个保密的大素数p和q之积——去除,然后取其余数。解密类似,不同的只是使用的是秘密的方幂d,e*d≡1(mod(P-1)*(q-1)),系统的保密性部分地依赖于对公布的除数n难于进行因子分解。
We propose an encryption method that has the singular characteristic that public disclosure of encryption keys does not expose the corresponding decryption keys. This has two important consequences: (1) The transfer of keys does not require couriers or other covert means as the messages can be encrypted with the encryption key publicly disclosed by the intended recipient. Only he can solve this kind of news because only he knows the corresponding decryption key. (2) The message can be signed with a secret decryption key. Anyone can verify this signature with the corresponding publicly disclosed encryption key; the signature can not be forged; nor can the signer subsequently deny the authenticity of his signature. This has obvious uses in “e-mail” and “electronic remittance” systems. The message can be encrypted in such a way that it is represented as a number M, which is raised by M to a publicly specified power e, with a publicly specified n, which is the product of two secret large primes p and q - Remove, then take the rest. The decryption is similar, except that the secret power d, e * d≡1 (mod (P-1) * (q-1)) is used, the confidentiality of the system depends in part on the difficulty with the divisor n being published Factorization.