Subproject 3 of TeSSA: Elliptic curve cryptosystems
Introduction
The goal of this subproject is to research the application of elliptic curve cryptosystems in telecommunication security and to implement these cryptosystems in Java 2.
Goals
A central part of a network security architecture is a suitable public key cryptosystem. For some time, elliptic curves have been known to be suitable for cryptography, but their use has so far been quite limited. Currently the most popular public key cryptosystem is RSA. It is based on the problem of factoring large numbers. However, there has been significant progres in the field of factoring during the past 20 years, which has led to increasing key lengths. It is quite propable that this progress is not going to slow down in the near future, so the key lengths keep growing. Elliptic curves, on the other hand, are based on a different problem, which makes the keys significantly shorter - and they are not growing nearly as fast.
In 1999 we are focusing on implementing elliptic curve cryptosystems on JavaCard, a limited subset of Java 2. We are also pursuing the research of hyperelliptic curves, which should provide even shorter keys.
Publications and results
Presentations
Links
Tämän sivun sisällöstä vastaa Yki Kortesniemi, Email: yki.kortesniemi@hut.fi
Sivua on viimeksi päivitetty 9.9.1998.
URL: http://www.tcm.hut.fi/Tutkimus/TeSSA