Efficient GF(p m) Arithmetic Architectures for Cryptographic Applications (original) (raw)

Lecture Notes in Computer Science, 2003

Christof Paar

Thomas Wollinger

Abstract

Abstract. Recently, there has been a lot of interest on cryptographic applications based on fields GF(pm ), for p>2. This contribution presents GF(pm ) multipliers architectures, where p is odd. We present designs which trade area for performance based on the number of ...

Christof Paar hasn't uploaded this paper.

Let Christof know you want this paper to be uploaded.

Ask for this paper to be uploaded.