@inproceedings{b88024e451ba4aa2b1a83e9c1377b1d6,
title = "Delaying and merging operations in scalar multiplication: Applications to curve-based cryptosystems",
abstract = "In this paper we introduce scalar multiplication algorithms for several classes of elliptic and hyperelliptic curves. The methods are variations on Yao's scalar multiplication algorithm where independent group operations are shown in an explicit way. We can thus merge several group operations and reduce the number of field operations by means of Montgomery's trick. The results are that scalar multiplication on elliptic curves in even characteristic based on point halving can be improved by at least 10% and the performance of Koblitz curves by 25% to 32%.",
author = "Avanzi, {Roberto Maria}",
year = "2007",
doi = "10.1007/978-3-540-74462-7_15",
language = "English",
isbn = "9783540744610",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "203--219",
booktitle = "Selected Areas in Cryptography - 13th International Workshop, SAC 2006, Revised Selected Papers",
address = "Germany",
note = "13th International Workshop on Selected Areas in Cryptography, SAC 2006 ; Conference date: 17-08-2006 Through 18-08-2006",
}