| Presentation | 1997/11/20 On Smoothness of Numbers Akira HAYASHI, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The author previously proposed a fast method for computing a power of a large integer under a modulus n. The performance of the method depends on how smooth numbers n+a are for two different a's. In this report we investigate the distribution of the two largest prime factors of p+1 and p+2, where p is a prime number. Computer experiments show the numbers of the above type are not different from general integers in smoothness. This result indicates effectiveness of the proposed computing method. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | public key cryptosystem / modular powering / smoothness of numbers |
| Paper # | ISEC97-49 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1997/11/20(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 | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On Smoothness of Numbers |
| Sub Title (in English) | |
| Keyword(1) | public key cryptosystem |
| Keyword(2) | modular powering |
| Keyword(3) | smoothness of numbers |
| 1st Author's Name | Akira HAYASHI |
| 1st Author's Affiliation | Kanazawa Institute of Technology() |
| Date | 1997/11/20 |
| Paper # | ISEC97-49 |
| Volume (vol) | vol.97 |
| Number (no) | 381 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |