| Presentation | 1998/7/30 A Complete Cyclic Analysis of RSA Cryptosystem, II Hideo Suzuki, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this series of papers, we have shown the algorithm for computing all RSA cycles and cardnalities, and the algorithm for computing all orders and cardinalities in modulo any composite form. We have shown, for the first time, exact probabilities using these algorithms. We conclude that the success probability by Simmons-Norris's cycle attack is nearly equal to the tested RSA cycles devided by n. The success probability by Williams-Schmid's generalized cycle attack is nearly equal to the tested RSA cycles devided by p or q. Then, we have inspected that, even if e is chosen at random, cycle related attacks are not effective to break into RSA cryptosystem. In addition, including the result of the previous paper that the occurrence probability of small exponent problem using φ (n) is very small such that 10^<-45>, we can use function φ (n) for computing key pair of (e, d). This concludes that the original RSA paper [2] is adequate for claiming to use φ (n), not limited to λ (n). |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | public key crytography / RSA cryptosystem / cycle of RSA cryptosystem / period of RSA cryptosystem / small exponent key problem / number theory / order modulo composite |
| Paper # | ISEC98-14 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1998/7/30(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Complete Cyclic Analysis of RSA Cryptosystem, II |
| Sub Title (in English) | |
| Keyword(1) | public key crytography |
| Keyword(2) | RSA cryptosystem |
| Keyword(3) | cycle of RSA cryptosystem |
| Keyword(4) | period of RSA cryptosystem |
| Keyword(5) | small exponent key problem |
| Keyword(6) | number theory |
| Keyword(7) | order modulo composite |
| 1st Author's Name | Hideo Suzuki |
| 1st Author's Affiliation | JVC Laboratory of America() |
| Date | 1998/7/30 |
| Paper # | ISEC98-14 |
| Volume (vol) | vol.98 |
| Number (no) | 227 |
| Page | pp.pp.- |
| #Pages | 12 |
| Date of Issue | |