Efficient Window-Based Elliptic Curve Scalar Multiplication Using Double Base Number Representation.

Date of Submission

December 2007

Date of Award

Winter 12-12-2008

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Theoretical Statistics and Mathematics Unit (TSMU-Bangalore)

Supervisor

Barua, Rana (TSMU-Kolkata; ISI)

Abstract (Summary of the Work)

Exponentiation is the most basic operation in the implementation of all discrete logarithm based cryptosystems. It translates to scalar multiplication, where the underlying group is additive in nature. Window based methods are very efficient methods to compute exponentiation. Double-base number system (DBNS) is a non standard number representation scheme with many interesting and useful properties. In this work we have proposed method for scalar multiplication where scalar (integer) is represented in DBNS format. We have adopted new way to represent the scalar in DBNS format. For that we have new algorithm to have representation in DBNS. This algorithm is faster than the previous conversion algorithms. The proposed method is more efficient than its single base counter part as well as straight double base part.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843137

Control Number

ISI-DISS-2007-199

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6363

This document is currently not available here.

Share

COinS