| Presentation | 1995/12/14 A Uniquely Decipherable Rabin-type Scheme over Elliptic Curves Hidenori Kuwakado, Kenji Koyama, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We propose a Rabin-type scheme over elliptic curves by^2≡x^3+x (mod n). Our scheme is uniquely decipherable by using 2-bit information. The decryption speed of our scheme is about 5.8 times faster than that of the previous Rabin-type scheme over elliptic curves. In broadcast applications, our scheme and the previous Rabin-type scheme over elliptic curves are more secure than the Rabin scheme. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Rabin scheme / factorization / unique decipherability / elliptic curve |
| Paper # | ISEC95-33 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1995/12/14(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 Uniquely Decipherable Rabin-type Scheme over Elliptic Curves |
| Sub Title (in English) | |
| Keyword(1) | Rabin scheme |
| Keyword(2) | factorization |
| Keyword(3) | unique decipherability |
| Keyword(4) | elliptic curve |
| 1st Author's Name | Hidenori Kuwakado |
| 1st Author's Affiliation | NTT Communication Science Laboratories() |
| 2nd Author's Name | Kenji Koyama |
| 2nd Author's Affiliation | NTT Communication Science Laboratories |
| Date | 1995/12/14 |
| Paper # | ISEC95-33 |
| Volume (vol) | vol.95 |
| Number (no) | 422 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |