"Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography."

Jean-Claude Bajard et al. (2003)

> Home

Details and statistics

DOI: 10.1109/ARITH.2003.1207677

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/arith/BajardINP03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/arith/BajardINP03
Jean-Claude Bajard, Laurent Imbert, Christophe Nègre, Thomas Plantard:
Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. IEEE Symposium on Computer Arithmetic 2003: 181-187

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.