作者: Matthias Ernst , Ellen Jochemsz , Alexander May , Benne de Weger
DOI: 10.1007/11426639_22
关键词:
摘要: We present several attacks on RSA that factor the modulus in polynomial time under condition a fraction of most significant bits or least private exponent is available to attacker. Our new are first this type work up full size public exponent.