# Implementations of Elliptic Curve Cryptography

@inproceedings{Murari2003ImplementationsOE, title={Implementations of Elliptic Curve Cryptography}, author={A. Murari}, year={2003} }

Elliptic Curve Cyrptography has gained a lot of significance in recent times. This is mostly due to the small key sizes associated with Elliptic Curve Cryptograhic systems. This paper presents a study of various algorithms for performing underlying field arithmetic and point representation useful in software implementations of Elliptic curve cyptography over prime fileds as well as binary fields.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 10 REFERENCES

Software Implementation of Elliptic Curve Cryptography over Binary Fields

- Computer Science
- 2000

- 507
- Open Access

Software Implementation of the NIST Elliptic Curves Over Prime Fields

- Computer Science
- 2001

- 284
- Highly Influential
- Open Access

Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field

- Computer Science
- 1999

- 22
- Open Access

A Fast Software Implementation for Arithmetic Operations in GF(2n)

- Computer Science
- 1996

- 153
- Open Access

A Small and Fast Software Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-Bit Microcomputer (Special Section on Cryptography and Information Security)

- Mathematics, Computer Science
- 1999

- 14

Elliptic Curve Cryptography in Practice — The Austrian Citizen Card for e-Government Applications

- Computer Science
- 2002

- 2

Vagle . A gentle introduction to elliptic curve cryptography