Sciweavers

10 search results - page 2 / 2
» Flexible hardware reduction for elliptic curve cryptography ...
Sort
View
ISCAS
2006
IEEE
76views Hardware» more  ISCAS 2006»
13 years 11 months ago
Flexible hardware architectures for curve-based cryptography
— This paper compares implementations of elliptic and hyperelliptic curve cryptography (ECC and HECC) on an FPGA platform. We use the same low-level blocks to implement the basic...
Lejla Batina, Nele Mentens, Bart Preneel, Ingrid V...
CARDIS
2000
Springer
124views Hardware» more  CARDIS 2000»
13 years 9 months ago
Elliptic Curve Cryptography on Smart Cards without Coprocessors
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
Adam D. Woodbury, Daniel V. Bailey, Christof Paar
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
13 years 2 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...
IAJIT
2006
145views more  IAJIT 2006»
13 years 4 months ago
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
Adnan Abdul-Aziz Gutub
TC
2010
12 years 11 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...