Skip to Main content Skip to Navigation
Conference papers

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

Jean-Claude Bajard 1 Laurent Imbert 1 Christophe Negre 2 Thomas Plantard 2
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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 : Friday, January 10, 2020 - 3:36:04 PM

Identifiers

  • HAL Id : lirmm-00269538, version 1

Collections

CNRS | ARITH | LIRMM | MIPS | UNIV-MONTPELLIER

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

106