Abstract
This paper investigates software optimization of special multiplication. In particular we concentrate on ax+b mod 264+13 mod 264 which is the bottleneck operation in the DFC cipher. We show that we can take advantage of the language and architecture properties in order to get effcient implementations. In this paper we use the ANSI C and the Java languages. We also investigate assembly code, and data structure alternatives. Finally, we show that we can also use floating point arithmetic.
Cite
CITATION STYLE
Noilhan, F. (2000). Software optimization of decorrelation module. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1758, pp. 175–183). Springer Verlag. https://doi.org/10.1007/3-540-46513-8_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
