A Comparison of CEILIDH and XTR

  • R. Granger
  • D. Page
  • M. Stam
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3076)

Abstract

We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimensional algebraic torus \(T_{6}(\mathbb{F}_{p})\). However, while they both attain the same discrete logarithm security and each achieve a compression factor of three for all data transmissions, the arithmetic performed in each is fundamentally different. In its inception, the designers of CEILIDH were reluctant to claim it offers any particular advantages over XTR other than its exact compression and decompression technique. From both an algorithmic and arithmetic perspective, we develop an efficient version of CEILIDH and show that while it seems bound to be inherently slower than XTR, the difference in performance is much smaller than what one might infer from the original description. Also, thanks to CEILIDH’s simple group law, it provides a greater flexibility for applications, and may thus be considered a worthwhile alternative to XTR.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • R. Granger
    • 1
  • D. Page
    • 1
  • M. Stam
    • 1
  1. 1.Department of Computer ScienceUniversity of BristolBristolUK

Personalised recommendations