Side channel attack resistant elliptic curves cryptosystem on multi-cores for power efficiency Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/2b88qf884

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • The Advent of multi-cores allows programs to be executed much faster than before. Cryptoalgorithms use long-bit words thus parallelizing these operations on multi-cores will achieve significant performance improvement. However, not all long-bit word operations in cryptosystems are suitable for parallel execution on multi-cores. In particular, long-bit words used in Elliptic Curves Cryptography (ECC) do not efficiently divide by the system word size. This causes some of the cores to be idle, which makes it vulnerable for attackers to guess how many operations occurred and thus what field size is being used. Multiplication is the most important part of public key cryptosystems. Long-bit word multiplication operations are needed for encryption and decryption. J. Fan et al. proposed using Montgomery multiplication on multi-cores using GF(2²⁵⁶) [25, 26], which is suitable for comput-er systems with 16-bit or 32-bit word size. Fan‟s Montgomery multiplication is suitable for most RSA. However, in ECC, some GFs will cause idle cores. For example, suppose GF(2¹³¹) is used (which is one of the recommended word size by NIST) on a quad-core with a 32-bit word size, which requires [132/32] =5 iterations with the last iteration requiring just a 3-bit operation. This cause three of the cores to be idle during this time causing needless power consumption. The most general and the easiest way to make side channel attacks difficult is to insert dummy instructions to cover the idle processors. However, dummy instructions result in extra workloads that lead to performance degradation and increases in power consumption. In this thesis, we will present a multiplier adjuster technique to improve the execution time and the power consumption for the last unbalanced iteration. By appropriately applying dummy instructions between point-addition and point-doubling operations, a balanced point operation can be achieved in ECC. The performance and power-efficiency of the proposed method on multi-cores are analyzed for each GF used in ECC.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2008-07-04T21:59:49Z (GMT) No. of bitstreams: 1 thesis_final2.pdf: 1499467 bytes, checksum: 6b00f30ec820b1df1455cf87a9305963 (MD5)
  • description.provenance : Submitted by Jaewon Yoo (yoojae@onid.orst.edu) on 2008-06-13T21:31:38Z No. of bitstreams: 1 thesis_final2.pdf: 1499467 bytes, checksum: 6b00f30ec820b1df1455cf87a9305963 (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2008-07-09T19:42:57Z (GMT) No. of bitstreams: 1 thesis_final2.pdf: 1499467 bytes, checksum: 6b00f30ec820b1df1455cf87a9305963 (MD5)
  • description.provenance : Made available in DSpace on 2008-07-09T19:42:58Z (GMT). No. of bitstreams: 1 thesis_final2.pdf: 1499467 bytes, checksum: 6b00f30ec820b1df1455cf87a9305963 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items