Loading...
Please wait, while we are loading the content...
Similar Documents
ECC2K-130 on NVIDIA GPUs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gong, G. Gupta, K. C. |
| Copyright Year | 2012 |
| Abstract | Computations of small discrete logarithms are feasible even in “secure” groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption. This paper shows how to use a small group-specific table to accelerate these subroutines. The cost of setting up the table grows with the table size, but the acceleration also grows with the table size. This paper shows experimentally that computing a discrete logarithm in an interval of order ` takes only 1.93 · ` multiplications on average using a table of size ` precomputed with 1.21 · ` multiplications, and computing a discrete logarithm in a group of order ` takes only 1.77 · ` multiplications on average using a table of size ` precomputed with 1.24 · ` multiplications. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://pure.tue.nl/ws/files/3197603/713600517347077.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
