Free registration required

Executive Summary

Elliptic Curve Discrete Logarithm Problem (ECDLP) is one of the most important hard problems that modern cryptography, especially public key cryptography, relies on. And many efforts are dedicate to solve this problem. In recent days, GPU technology develops very fast and GPU has become a powerful tool for massive computation. In this paper, the authors give an implementation of parallel Pollard p method, for ECDLP on GPU, and eliminate nearly all the conditional branches in procedures for big integer, elliptic curve and iteration function. The experimental result shows that with the help of GPU, they can gain a speedup of more than one hundred times. The branchless procedures are also useful for preventing side channel attacks.

  • Format: PDF
  • Size: 237.1 KB