Cryptology ePrint Archive: Report 2011/654
Laurie Haustenne and Quentin De Neyer and Olivier Pereira
optimizations at various levels, from integer multiplication and field selection to various fixed-based EC point multiplication techniques.
Relying on a small volume of public precomputed data, our code provides
a speed-up of a factor 50 compared to previous existing implementations. We conclude with a discussion of the impact of our work on a concrete application: the Helios browser-based voting system.
Category / Keywords: implementation /
Date: received 3 Dec 2011
Contact author: olivier pereira at uclouvain be
Available format(s): PDF | BibTeX Citation
Version: 20111209:205024 (All versions of this report)
Short URL: ia.cr/2011/654
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]