Security

Novel Elliptic Curve Scalar Multiplication Algorithms for Faster and Safer Public-Key Cryptosystems

Free registration required

Executive Summary

Efficient and secure public-key cryptosystems are essential in today's age of rapidly growing Internet communications. Elliptic curve scalar multiplication in particular, which refers to the operation of multiplying a large integer by a point on an elliptic curve, is crucial for both data encryption technology as well as testing the security of cryptographic systems. The purpose of this project was to design and implement an elliptic curve scalar multiplication algorithm 10% faster than one of the best algorithms currently used: the binary double-add algorithm. The algorithm designed was based off of an operation that allowed for the tripling of a point and was derived from point doubling and addition operations.

  • Format: PDF
  • Size: 690.2 KB