| Presentation | 1996/11/18 A New Method for Modular Powering Akira HAYASHI, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We propose a method for computing a power of a large integer under a composite modulus n. We construct the residue modulo n from the two residues modulo n-1 and n-2, respectively. The key idea of the proposed method is that the latter two residues are derived relatively faster by the use of Chinese remaindering. An application to enciphering and deciphering in RSA systems is one among many. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | public key cryptosystem / modular powering / RSA cryptosystem |
| Paper # | ISEC96-49 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1996/11/18(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) | A New Method for Modular Powering |
| Sub Title (in English) | |
| Keyword(1) | public key cryptosystem |
| Keyword(2) | modular powering |
| Keyword(3) | RSA cryptosystem |
| 1st Author's Name | Akira HAYASHI |
| 1st Author's Affiliation | Kanazawa Institute of Technology() |
| Date | 1996/11/18 |
| Paper # | ISEC96-49 |
| Volume (vol) | vol.96 |
| Number (no) | 365 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |