Computer Science – Cryptography and Security
Scientific paper
2009-10-28
Computer Science
Cryptography and Security
Submitted as a Masters Thesis in the Mathematics department of the University of Washington
Scientific paper
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the reducibility of the elliptic curve discrete logarithm problem. With such diverse uses, understanding these objects is important for anyone interested in the field of elliptic curve cryptography. This paper, targeted at an audience with a knowledge of the basic theory of elliptic curves, provides an introduction to the necessary theoretical background for understanding what isogenies are and their basic properties. This theoretical background is used to explain some of the basic computational tasks associated with isogenies. Herein, algorithms for computing isogenies are collected and presented with proofs of correctness and complexity analyses. As opposed to the complex analytic approach provided in most texts on the subject, the proofs in this paper are primarily algebraic in nature. This provides alternate explanations that some with a more concrete or computational bias may find more clear.
No associations
LandOfFree
Isogenies of Elliptic Curves: A Computational Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Isogenies of Elliptic Curves: A Computational Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isogenies of Elliptic Curves: A Computational Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-718365