Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > On Distributed Computing on El...

On Distributed Computing on Elliptic Curves

Tommi Meskanen, Ari Renvall, Paula Steinby, On Distributed Computing on Elliptic Curves. In: Juhani Karhumäki, Herman Maurer, Gheorghe Paun, Grzegorz Rozenberg (Eds.), Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 3113, 181–191, Springer, 2004.

Abstract:

Let C be a device performing computations of a cryptographic protocol. Assume C to have limited computing power, but to have access to another device A with superior capacities. This setting would be likely to occur with a smart card C and a mobile phone A.

We consider the situation where C is supposed to calculate the basic operation of elliptic curve cryptography: the scalar multiplication of a point P on a curve. We investigate whether C's performance could be improved by means of distributed computation; that is, whether C could exploit A's computing power, without compromising the safety of the procedure. We set up three models of computation, varying the demand for C's trust on A's honesty.

BibTeX entry:

@INBOOK{cMeReSt04a,
  title = {On Distributed Computing on Elliptic Curves},
  booktitle = {Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday},
  author = {Meskanen, Tommi and Renvall, Ari and Steinby, Paula},
  volume = {3113},
  series = {Lecture Notes in Computer Science},
  editor = {Karhumäki, Juhani and Maurer, Herman and Paun, Gheorghe and Rozenberg, Grzegorz},
  publisher = {Springer},
  pages = {181–191},
  year = {2004},
  keywords = {cryptography, elliptic curves, distributed computing},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication