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

Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269538
Contributor : Christine Carvalho de Matos <>
Submitted on : Thursday, April 3, 2008 - 8:21:44 AM
Last modification on : Tuesday, December 11, 2018 - 5:16:02 PM

Identifiers

  • HAL Id : lirmm-00269538, version 1

Collections

Citation

Jean-Claude Bajard, Laurent Imbert, Christophe Negre, Thomas Plantard. Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography. ARITH-16'03: IEEE Symposium on Computer Arithmetic, Jun 2003, Santiago de Compostela, Spain. pp.181-187. ⟨lirmm-00269538⟩

Share

Metrics

Record views

98