University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A Comparison of CEILIDH and XTR

Granger, Robert, Page, D. and Stam, M. (2004) A Comparison of CEILIDH and XTR In: The 6th International Algorithmic Number Theory Symposium (ANTS-VI), 13-18 Jun 2004, Burlington, VT, USA.

Full text not available from this repository.


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 T6(Fp). 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.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Page, D.
Stam, M.
Date : 13 June 2004
DOI : 10.1007/978-3-540-24847-7_17
Copyright Disclaimer : © Springer-Verlag Berlin Heidelberg 2004
Depositing User : Clive Harris
Date Deposited : 08 Feb 2019 10:21
Last Modified : 08 Feb 2019 10:21

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800