Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2003
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⟩
64 View
0 Download

Share

Gmail Facebook X LinkedIn More