Elliptic curve cryptography has gained much popularity in the past decade and
has been challenging the dominant RSA/DSA systems today. This is mainly
due to elliptic curves offer cryptographic systems with higher speed, less memory
and smaller key sizes than older ones. Among the various arithmetic operations
required in implementing public key cryptographic algorithms based on elliptic
curves, the elliptic curve scalar multiplication has probably received the maximum
attention from the research community in the past a few years. Many methods for
efficient and secure implementation of scalar multiplication have been proposed by
many researchers. In this thesis, many scalar multiplication methods are studied
in terms of their mathematical, computational and implementational points.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12607753/index.pdf |
| Date | 01 August 2006 |
| Creators | Yayla, Oguz |
| Contributors | Akyildiz, Ersan |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0019 seconds