| Presentation | 2002/3/12 Lehmer-type improvement of the binary GCD method Kei HIROYOSHI, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | If we use Lehmer-type extended binary GCD method, we can calculate modular inversion of multi-precision integers efficiently[2]. In this paper, we propose a new algorithm to calculate modular inversion of multi-precision integers more efficiently. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | modular inversion / extended binary GCD method / multi-precision integers |
| Paper # | ISEC2001-136 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2002/3/12(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) | Lehmer-type improvement of the binary GCD method |
| Sub Title (in English) | |
| Keyword(1) | modular inversion |
| Keyword(2) | extended binary GCD method |
| Keyword(3) | multi-precision integers |
| 1st Author's Name | Kei HIROYOSHI |
| 1st Author's Affiliation | Graduate School of Information Systems, University of Electro-Communications() |
| Date | 2002/3/12 |
| Paper # | ISEC2001-136 |
| Volume (vol) | vol.101 |
| Number (no) | 728 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |