Efficient Implementation of Elliptic Curve Cryptography on Curve-25519, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
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)...
Cataloging briefEfficient Implementation of Elliptic Curve Cryptography on Curve-25519, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
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)...
Find in contentBookmark |
|