Increasing the Robustness of Point Operations in Co-Z Arithmetic against Side-Channel Attacks

Simple item page
dc.contributor.authorAlmohaimeed, Ziyad Mohammed
dc.contributor.supervisorSima, Mihai
dc.date.accessioned2013-08-08T22:00:15Z
dc.date.available2014-07-06T11:22:11Z
dc.date.copyright2013en_US
dc.date.issued2013-08-08
dc.degree.departmentDepartment of Electrical and Computer Engineering
dc.degree.levelMaster of Applied Science M.A.Sc.en_US
dc.description.abstractElliptic 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 for ECC is created by its shorter key length while it provides an equivalent security level in comparison to previously introduced public-key cryptosystems (e.g.RSA). From an implementation point of view a shorter key length means a higher processing speed, smaller power consumption, and silicon area requirement. Scalar multiplication is the main operation in Elliptic Curve Diffie-Hellman (ECDH), which is a key-agreement protocol using ECC. As shown in the prior literature, this operation is both vulnerable to Power Analysis attack and requires a large amount of time. 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 cryptographic attacks. The first scheme provides improved security at the expense of a very small cost of additional 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 tech- nique 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.en_US
dc.description.proquestcode0544en_US
dc.description.proquestcode0984en_US
dc.description.proquestemailz.mohaimeed@gmail.comen_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/4729
dc.languageEnglisheng
dc.language.isoenen_US
dc.rights.tempAvailable to the World Wide Weben_US
dc.subjectelliptic curve cryptographyen_US
dc.subjectpower analysisen_US
dc.subjectElliptic curve Diffie-Hellmanen_US
dc.subjectECDHen_US
dc.subjectECCen_US
dc.subjectatomic blocken_US
dc.subjectCountermeasure against Side-Channel Attacksen_US
dc.subjectSide-Channel Attack Aware Implementationen_US
dc.titleIncreasing the Robustness of Point Operations in Co-Z Arithmetic against Side-Channel Attacksen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Almohaimeed_Ziyad_MASc_2013.pdf
Size:
3.41 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.