Loading...
- Type of Document: Ph.D. Dissertation
- Language: Farsi
- Document No: 51975 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Bayat-Sarmadi, Siavash
- Abstract:
- Elliptic curve cryptography (ECC) has received attention because it can achieve the same security level as other classical asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to AlGemal and RSA cryptosystems, fast computation of ECC is always desirable. Point multiplication is an essential operation in cryptographic computations. Low-latency and low-complexity multiplication architectures lead to more efficient cryptosystems.In this thesis, a fixed-base comb point multiplication method has been used to perform regular point multiplication. Additionally, two low-complexity (LC) and low-latency (LL) architectures for the regular point multiplication using fixed-base comb method have been proposed.The point multiplication architectures have been implemented using field- programmable gate array (FPGA). The LC architecture implementation results over GF(2233), GF(2163), and GF(2283) show 62%, 46%, and 152% efficiency improvement, respectively. In addition, the LL architecture has 55%, 44%, and 76% reduction in point multiplication required time, respectively, over GF(2233), GF(2163), and GF(2283). Additionally, in this thesis, a high-throughput lowcomplexity unified field multiplier for triangular and dual bases is presented, and is referred to as basic architecture. Moreover, structurally improved architectures have been proposed, which have smaller time complexity than basic ones. This is achieved by the use of parallel processing method. Moreover, a low latency Karatsuba-Ofman based field multiplier (KOM) and an efficient point multiplication on Curve25519 have been proposed. The improvements have been achieved mainly due to the proposed low latency pipelined KOM and an efficient scheduling of
field operations.s - Keywords:
- Elliptic Curve Cryptography ; Fixed-Based Point Multiplication ; Field Multiplication ; High Efficiency Implementation
- محتواي کتاب
- view
- فهرست شکلها
- فهرست جدولها
- مقدمه
- آشنایی با رمزنگاری خم بیضوی
- کارهای پیشین
- ارزیابی اثر الگوریتم ضرب نقطهای بر افزایش کارایی رمزنگار خم بیضوی
- ارزیابی اثر زمانبندی عملیات بر افزایش کارایی رمزنگار خم بیضوی
- ارزیابی اثر ضرب میدانی بر افزایش کارایی رمزنگار خم بیضوی
- نتیجهگیری و کارهای آتی
- مراجع
- واژهنامه انگلیسی به فارسی
- واژهنامه فارسی به انگلیسی