Applying systolic multiplication–inversion architectures based on modified extended Euclidean algorithm for GF(2 k ) in elliptic curve cryptography

Elliptic curve cryptography is a very promising cryptographic method offering the same security level as traditional public key cryptosystems (RSA, El Gamal) but with considerably smaller key lengths. However, the computational complexity and hardware resources of an elliptic curve cryptosystem are...

Celý popis

Podrobná bibliografia

Vydané v:	Computers & electrical engineering Ročník 33; číslo 5; s. 333 - 348
Hlavní autori:	Fournaris, Apostolos P., Koufopavlou, O.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.09.2007
Predmet:	Elliptic curve cryptography Finite field arithmetic VLSI design Finite field arithmetic Elliptic curve cryptography VLSI design
ISSN:	0045-7906, 1879-0755
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!