On the performance of signature schemes based on elliptic curves (Q3840169)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1186947
Language Label Description Also known as
default for all languages
No label defined
    English
    On the performance of signature schemes based on elliptic curves
    scientific article; zbMATH DE number 1186947

      Statements

      0 references
      0 references
      0 references
      0 references
      29 June 1999
      0 references
      elliptic curves
      0 references
      cryptography
      0 references
      On the performance of signature schemes based on elliptic curves (English)
      0 references
      This paper details an implementation of an elliptic curve signature scheme on a Pentium based computer. The case of even and odd characteristic fields are compared and the authors conclude that odd characteristic fields are more efficient. The authors discuss field representations, point representations and methods for performing the exponentiation. The paper is well written and is useful since it is, to the reviewer's knowledge, the first place in the literature where practical timings of the two flavours of elliptic curve cryptosystems are given. It would be interesting to see whether other implementations also find that large odd characteristic fields are more efficient than even characteristic fields and whether a different (say RISC based) processor would behave differently. For the entire collection see [Zbl 0891.00022].
      0 references

      Identifiers