Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2003

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

Christine Carvalho De Matos  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269538

Submitted on : Thursday, April 3, 2008-8:21:44 AM

Last modification on : Friday, March 24, 2023-2:52:50 PM

No file

Dates and versions

lirmm-00269538 , version 1 (03-04-2008)

Identifiers

  • HAL Id : lirmm-00269538 , version 1

Cite

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 XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS LIRMM MIPS UNIV-MONTPELLIER
69 View
0 Download

Share

More