@inproceedings{2aa1e0887fe1467c8575cbfe0587c9ed,
title = "Resource requirements for the application of addition chains in modulo exponentiation",
abstract = "Addition chains or sequences can be used to reduce the amount of multiplications to accomplish an exponentiation at the cost of more memory required. We examine known methods of exponentiations based on addition sequences and derive the parameters determining operation count and number of required registers for storing intermediate results. As a result an improved method is proposed to choose window distributions as a basis for using known addition sequence heuristics.",
keywords = "Addition sequence, Computation rule, Operation count, Solid state circuit, Window size",
author = "J{\"o}rg Sauerbrey and Andreas Dietel",
note = "Publisher Copyright: {\textcopyright} Spnnger-Verlag Berlln Heldelberg 1993.; 11th Workshop on the Theory and Application of of Cryptographic Techniques, EUROCRYPT 1992 ; Conference date: 24-05-1992 Through 28-05-1992",
year = "1993",
doi = "10.1007/3-540-47555-9\_15",
language = "English",
isbn = "9783540564133",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "174--182",
editor = "Rueppel, \{Rainer A.\}",
booktitle = "Advances in Cryptology – EUROCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings",
}