• home
• current students
• graduate
• events

Presenter: Ziyad Almohaimeed
Supervisor: Dr. Mihai Sima

Date: Wed, June 26, 2013
Time: 10:30:00 - 00:00:00
Place: EOW 430

ABSTRACT

ABSTRACT:

Elliptic curve cryptography (ECC) has played a significant role on secure devices since it was introduced by Koblitz and Miller more than three decades ago. The great demand on ECC is given by its shorter key size, which provides an equivalent security level in comparison to earlier public-key cryptosystems (e.g. RSA). From an implementation point of view a shorter key length means a higher processing speed and a smaller power consumption and silicon area. Scalar multiplication is the main operation in Elliptic Curve Diffie-Hellman (ECDH), which is a key-agreement protocol in ECC. As shown in prior art, this operation is both vulnerable to Power Analysis attack and time-consuming. Therefore, a lot of research has focused on enhancing the performance and security of scalar multiplication. In this work, we describe three schemes to counter power analysis attacks. The first scheme provides an improved security at the expense of a very small hardware overhead; its basic idea is to randomize independent field operations in order to have multiple power consumption traces for each point operation. In the second scheme, we introduce an atomic block that consists of addition, multiplication and addition [A-M-A]. This technique provides a very good scalar multiplication protection but with increased computation cost. The third scheme provides both security and speed by adopting the second techniques and enhancing the instruction-level parallelism at the atomic level. As a result, the last scheme also provides a reduction in computing time. With these schemes the users can optimize the trade-off between speed, cost, and security level according to their needs and resources.