Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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

Document type :
Conference papers
Complete list of metadata
Contributor : Christine Carvalho De Matos Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2008 - 8:21:44 AM
Last modification on : Friday, October 22, 2021 - 3:07:18 PM


  • HAL Id : lirmm-00269538, version 1



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⟩



Record views