## Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures (2004)

Venue: | In Selected Areas in Cryptology – SAC 2003, Springer-Verlag LNCS 3006 |

Citations: | 10 - 3 self |

### BibTeX

@INPROCEEDINGS{Avanzi04genericefficient,

author = {Roberto Maria Avanzi and Preda Mihăilescu},

title = {Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures},

booktitle = {In Selected Areas in Cryptology – SAC 2003, Springer-Verlag LNCS 3006},

year = {2004},

pages = {320--334},

publisher = {Springer}

}

### OpenURL

### 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 < 2 w 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.