Logo image
Se connecter
Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography
Acte de colloque

Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography

Jean-Claude Bajard, Laurent Imbert, Christophe Negre et Thomas Plantard
ARITH-16'03: IEEE Symposium on Computer Arithmetic, pp.181-187
ARITH-16'03: IEEE Symposium on Computer Arithmetic (Santiago de Compostela, Spain, 15/06/2003–18/06/2003)
2003

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image