| Presentation | 1999/11/8 Genarating Elliptic Curves Suitable for Factorization Tetsuya IZU, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Among the integer factorization algorithms, the Elliptic Curve Method (ECM) is the best one in the factor-dependent type. The ECM may be applied to the large composite number. When we use the ECM, the order of a curve is desired to be smooth. In this paper, we propose the new curve-generation method, whose order is divisible by 20, considering the division polynomial. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | integer factorization / Elliptic Curve Method (ECM) / order / division polynomial |
| Paper # | ISEC99-60 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1999/11/8(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) | Genarating Elliptic Curves Suitable for Factorization |
| Sub Title (in English) | |
| Keyword(1) | integer factorization |
| Keyword(2) | Elliptic Curve Method (ECM) |
| Keyword(3) | order |
| Keyword(4) | division polynomial |
| 1st Author's Name | Tetsuya IZU |
| 1st Author's Affiliation | Secure Computing Lab, FUJITSU Laboratories Ltd.() |
| Date | 1999/11/8 |
| Paper # | ISEC99-60 |
| Volume (vol) | vol.99 |
| Number (no) | 414 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |