加密
公钥密码术
数字签名
整数(计算机科学)
钥匙(锁)
密码学
计算机科学
方案(数学)
确定性加密
数学
理论计算机科学
算法
算术
计算机安全
散列函数
数学分析
程序设计语言
标识
DOI:10.1109/tit.1980.1056264
摘要
The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer R used as the modulus can be factored. It my however be possible to break this system without factoring R . A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, then R can be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme.
科研通智能强力驱动
Strongly Powered by AbleSci AI