@inbook{5dc92eea11a64785b1e2d7ad756016a9,
title = "Generic efficient arithmetic algorithms for PAFFs (Processor Adequate Finite Fields) and related algebraic structures (extended abstract)",
abstract = "In the past years several authors have considered finite fields extensions of odd characteristic optimised for a given architecture to obtain performance gains. The considered fields were however very specific. We define a Processor Adequate Finite Field (PAFF) as a field of odd characteristic p < 2w where w is a CPU related word length. PAFFs have several attractive properties for cryptography. In this paper we concentrate on arithmetic aspects. We present some algorithms usually providing better performance in PAFFs than in prime fields and in previously proposed instances of extension fields of comparable size.",
keywords = "Discrete logarithm systems, Exponentiation algorithms, Finite extension fields, Modular reduction",
author = "Avanzi, {Roberta Maria} and Preda Mihǎilescu",
year = "2004",
doi = "10.1007/978-3-540-24654-1_23",
language = "English",
isbn = "3540213708",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "320--334",
editor = "Mitsuru Matsui and Robert Zuccherato",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}