Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Efficient hardware implementation of elliptic curve cryptosystems

In: Tatra Mountains Mathematical Publications, vol. 33, no. 1
Krzysztof Gołofit
Detaily:
Rok, strany: 2006, 41 - 50
O článku:
The paper focuses on a fast hardware implementation of the most difficult and time consuming operation within elliptic curve cryptosystems: the multiplication of point. When applied, it can significantly boost the overall performance making it possible to be implemented at the lowest level of design: full custom VLSI. The paper starts with a short introduction to ECC using optimal normal bases over finite fields of characteristic two. The main part describes an idea of a cryptographic accelerator and its model designed in the VLSI technology (a 0.35 $μ$\=m process using 3 metallization layers). Then the results are analyzed and projected for more advanced technologies giving an estimation of achievable parameters.
Ako citovať:
ISO 690:
Gołofit, K. 2006. Efficient hardware implementation of elliptic curve cryptosystems. In Tatra Mountains Mathematical Publications, vol. 33, no.1, pp. 41-50. 1210-3195.

APA:
Gołofit, K. (2006). Efficient hardware implementation of elliptic curve cryptosystems. Tatra Mountains Mathematical Publications, 33(1), 41-50. 1210-3195.