RSA-padding signatures with attack studies

被引:0
作者
Stephanides, George [1 ]
Constantinescu, Nicolae [1 ]
Cosulschi, Mirel [1 ]
Gabroveanu, Mihai [1 ]
机构
[1] Univ Macedonia, Dept Appl Informat, GR-54006 Thessaloniki, Greece
来源
WEBIST 2006: Proceedings of the Second International Conference on Web Information Systems and Technologies: INTERNET TECHNOLOGY / WEB INTERFACE AND APPLICATIONS | 2006年
关键词
RSA cryptosystem; digital signature; fixed pattern padding;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A fixed-pattern padding consists in concatenating to the message m a fixed pattern P. An RSA signature for the padding P and message m is obtained by raising the message m and the padding P to the private decryption exponent d. In this paper we prove that the security of RSA fixed-pattern padding is insecure for messages at least two-thirds of the size of n, the RSA public modulus.
引用
收藏
页码:97 / 100
页数:4
相关论文
共 7 条
[1]  
Girault M., 1988, LNCS, V403, P100
[2]  
GIRAULT M, 1997, LNCS, V1233, P495
[3]  
JONGE WD, 1986, LNC, V218, P18
[4]   FACTORING POLYNOMIALS WITH RATIONAL COEFFICIENTS [J].
LENSTRA, AK ;
LENSTRA, HW ;
LOVASZ, L .
MATHEMATISCHE ANNALEN, 1982, 261 (04) :515-534
[5]  
MISARSKY JF, 1998, LECT NOTES COMPUTER, V1431, P14
[6]  
*NETW WORK GROUP, 1998, 1 RSA PKCS NETW WORK
[7]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017