A Generalization of de Weger's Method

被引：5

作者：

Chen, Chien-Yuan ^{[1
]}

Hsueh, Chih-Cheng ^{[2
]}

Lin, Yu-Feng ^{[1
]}

机构：

[1] Natl Univ Kaohsiung, Dept Comp Sci & Informat Engn, Kaohsiung 811, Taiwan

[2] Aletheia Univ, Dept Informat & Commerce, Tainan 72147, Taiwan

来源：

FIFTH INTERNATIONAL CONFERENCE ON INFORMATION ASSURANCE AND SECURITY, VOL 1, PROCEEDINGS | 2009年

关键词：

RSA; continued fraction attack; RSA SECRET EXPONENTS; WIENERS ATTACK; CRYPTANALYSIS;

D O I：

10.1109/IAS.2009.153

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper generalizes de Weger's method if the ratio of two RSA primes p/q is close to a simple fraction b/a. We can discover the secret exponent d < N-lambda/4 gamma from the convergents of e/N+1-a+b/root ab root N for |ap-bq|=N-gamma. Our method is thus reduced to de Weger's method if a=b=1. When b/a = 1/2, our method is reduced to Maitra and Sarkar's method.

引用

页码：344 / +

页数：2

共 13 条

[1]

[Anonymous], 1981, The Art of Computer Programming

[2]

Blömer J, 2004, LECT NOTES COMPUT SC, V2947, P1

[3]

CHEN CY, 1996, J INFORMATION SCI EN, V12, P277

[4] Cryptanalysis of RSA with small prime difference [J].

de Weger, B .

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2002, 13 (01) :17-28

[5]

Dujella A., 2004, Tatra Mountains Mathematical Publications, V29, P101

[6]

Graham RL., 1994, Concrete Mathematics: A Foundation for Computer Science, V2

[7]

Maitra S, 2008, LECT NOTES COMPUT SC, V5222, P228, DOI 10.1007/978-3-540-85886-7_16

[8]

NASSR DI, 2008, 6 ACS IEEE INT C COM, P694

[9]

Nitaj A, 2008, LECT NOTES COMPUT SC, V5023, P174

[10]

RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017

← 1 2 →