TU Darmstadt / ULB / TUbiblio

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

Blümel, Rainer ; Laue, Ralf ; Huss, Sorin A. (2005)
A highly efficient modular multiplication algorithm for finite field arithmetic in GF(P).
Conference or Workshop Item, Bibliographie

Item Type: Conference or Workshop Item
Erschienen: 2005
Creators: Blümel, Rainer ; Laue, Ralf ; Huss, Sorin A.
Type of entry: Bibliographie
Title: A highly efficient modular multiplication algorithm for finite field arithmetic in GF(P)
Language: English
Date: 2005
Series: 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
Last Modified: 05 Mar 2013 09:07
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details