Loading...

Efficient Implementation of Elliptic Curve Cryptography on Curve-25519

Rashidi Toghroljerdi, Zeinab | 2019

583 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 54712 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Bayat Sarmadi, Siavash
  7. Abstract:
  8. Elliptic curve cryptography (ECC) has received attention because it can achieve a security level similar to other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to other asymmetric methods, fast computation of ECC is always desirable. In this thesis, a fixed-base comb point multiplication method has been modified to perform regular point multiplication. Additionally, two low-complexity and lowlatency architectures for the modified point multiplication algorithm has been proposed. In order to achieve these architectures, a low-latency pipelined digit-level field multiplier for all national institute of standards and technology (NIST) recommended polynomial has been introduced. The point multiplication architectures has been implemented using FPGA. It has been shown that the time complexity of this work is less than that for previous work. In worse case, the low-complexity architecture implementation result over GF(2233) and GF(2163) show 65 and 6 times efficiency improvement, respectively. Additionally, the low-latency architecture have 65% and 56% reduction in point multiplication time complexity, respectively, using trinomials and pentanomials
  9. Keywords:
  10. Fixed-Based Point Multiplication ; Elliptic Curve Cryptography ; Unknown Points ; Low Latency ; Low Complexity ; Asymmetric Cryptography

 Digital Object List

 Bookmark