William J. Martin
This thesis examines the Mordell-Weil group for application in cryptography. This approach has recently been proposed by Gerhard Frey. The use of the Mordell-Weil group for discrete logarithm schemes is a variant of elliptic curve cryptosystems. We extended the original idea by Frey with the goal of a performance improvement. The arithmetic complexity using the Mordell-Weil group will be compared to ordinary elliptic curve cryptosystems. The main goals of this thesis are (1) to investigate the algorithmic complexity of Mordell-Weil cryptosystems relative to elliptic curve cryptosystems; (2) the appropriate selection of the group parameters for a successful adaptation to different platforms; (3) a C++ library which makes it possible to easily use this algebra for cryptographic systems based on groups; and (4) to obtain software performance measures for the new cryptosystem. Point multiplication, the crucial operation for elliptic curve cryptosystems, is more than 20% less complex in the Mordell-Weil group than in an ordinary elliptic curve while preserving the same level of security. We show how to further improve the system such that it is particularly suited to 32-bit and 16-bit hardware platforms. The speed-up of the Mordell-Weil group approach comes at the cost of a slightly larger bit-size that is needed to represent a curve point and a more costly curve generation.
Worcester Polytechnic Institute
All authors have granted to WPI a nonexclusive royalty-free license to distribute copies of the work. Copyright is held by the author or authors, with all rights reserved, unless otherwise noted. If you have any questions, please contact firstname.lastname@example.org.
Weimerskirch, Andre, "The Application of the Mordell-Weil Group to Cryptographic Systems" (2001). Masters Theses (All Theses, All Years). 321.
Frobenius map, point multiplication, elliptic curves, Mordell-Weil group