TU Darmstadt / ULB / TUbiblio

A highly efficient modular multiplication algorithm for finite field arithmetic in GF(P)

Blümel, Rainer and Laue, Ralf and Huss, Sorin A. (2005):
A highly efficient modular multiplication algorithm for finite field arithmetic in GF(P).
In: ECRYPT Workshop, CRyptographic Advances in Secure Hardware, September 6-7, 2005, Leuven, Belgium, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2005
Creators: Blümel, Rainer and Laue, Ralf and Huss, Sorin A.
Title: A highly efficient modular multiplication algorithm for finite field arithmetic in GF(P)
Language: English
Series Name: ECRYPT Workshop, CRyptographic Advances in Secure Hardware, September 6-7, 2005, Leuven, Belgium
Divisions: 18 Department of Electrical Engineering and Information Technology
20 Department of Computer Science > Integrated Circuits and Systems
20 Department of Computer Science
Date Deposited: 20 Nov 2008 08:23
License: [undefiniert]
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item