Scalar multiplication on elliptic curves


Creative Commons License

Doç. Dr. OĞUZ YAYLA

Tez Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Uygulamalı Matematik Enstitüsü, Kriptografi Anabilim Dalı, Türkiye

Tez Danışmanı: Ersan Akyıldız

Tezin Onay Tarihi: 2006

Tezin Dili: İngilizce

Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu

Desteklendiği Program: Diğer

Özet:

Elliptic curve cryptography has gained much popularity in the past decade andhas been challenging the dominant RSA/DSA systems today. This is mainlydue to elliptic curves offer cryptographic systems with higher speed, less memoryand smaller key sizes than older ones. Among the various arithmetic operationsrequired in implementing public key cryptographic algorithms based on ellipticcurves, the elliptic curve scalar multiplication has probably received the maximumattention from the research community in the past a few years. Many methods forefficient and secure implementation of scalar multiplication have been proposed bymany researchers. In this thesis, many scalar multiplication methods are studiedin terms of their mathematical, computational and implementational points.