Scalar multiplication on elliptic curves

Download

index.pdf

Date

2006

Author

Yayla, Oğuz

Metadata

Show full item record

Item Usage Stats

204
views

55
downloads

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.

Subject Keywords

Electronic Computers., Computer Science.

URI

http://etd.lib.metu.edu.tr/upload/12607753/index.pdf
https://hdl.handle.net/11511/15942

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Efficient scheduling in distributed computing on grid Kaya, Özgür; Bozyiğit, Müslim; Department of Computer Engineering (2006) Today many computing resources distributed geographically are idle much of time. The aim of the grid computing is collecting these resources into a single system. It helps to solve problems that are too complex for a single PC. Scheduling plays a critical role in the efficient and effective management of resources to achieve high performance on grid computing environment. Due to the heterogeneity and highly dynamic nature of grid, developing scheduling algorithms for grid computing involves some challenges....
Resource-aware load balancing system with artificial neural networks Yıldız, Ali; Şener, Cevat; Department of Computer Engineering (2006) As the distributed systems becomes popular, efficient load balancing systems taking better decisions must be designed. The most important reasons that necessitate load balancing in a distributed system are the heterogeneous hosts having different com- puting powers, external loads and the tasks running on different hosts but communi- cating with each other. In this thesis, a load balancing approach, called RALBANN, developed using graph partitioning and artificial neural networks (ANNs) is de- scribed. The ...
Elliptic curves and use of their endomorphism rings in cryptography Sülçe, Ali Mert; Akyıldız, Ersan; Department of Cryptography (2019) Although elliptic curves have been studied for hundreds of years, the inception of elliptic curve cryptography is 1985 by Koblitz’s and Miller’s independent proposals that is based on the discrete logarithm problem on an elliptic curve defined over a finite field. After that date, there are a lot of advances and studies in elliptic curve cryptography(ECC) which provide high security with relatively small block sizes and high speed compared to the other public key cryptosystems. For instance, 160-bit ellipti...
Collaborative and Cognitive Network Platforms: Vision and Research Challenges Onur, Ertan; Hawas, Mohamed Gamal; de Groot, Sonia Marcela Heemstra; Niemegeers, Ignas G. M. M. (Springer Science and Business Media LLC, 2011-05-01) In this paper, we present a visionary concept referred to as Collaborative and Cognitive Network Platforms (CCNPs) as a future-proof solution for creating a dependable, self-organizing and self-managing communication substrate for effective ICT solutions to societal problems. CCNP creates a cooperative communication platform to support critical services across a range of business sectors. CCNP is based on the personal network (PN) technology which is an inherently cooperative environment prototyped in the D...
Sequential and parallel heuristic algorithms for the rectilinear Steiner tree problem Cinel, Sertaç; Bazlamaçcı, Cüneyt Fehmi; Department of Electrical and Electronics Engineering (2006) The Steiner Tree problem is one of the most popular graph problems and has many application areas. The rectilinear version of this problem, introduced by Hanan, has taken special attention since it addresses a fundamental matter in “Physical Design” phase of the Very Large Scale Integrated (VLSI) Computer Aided Design (CAD) process. The Rectilinear Steiner Tree Problem asks for a minimum length tree that interconnects a given set of points by only horizontal and vertical line segments, enabling the use of e...

Citation Formats

O. Yayla, “Scalar multiplication on elliptic curves,” M.S. - Master of Science, Middle East Technical University, 2006.