Name
Abstract | ||
|---|---|---|
Elliptic Curve Cryptographic (ECC) systems have gained a lot of attention due to its excellent security strength for relatively small key sizes. The most common and computationally intensive task in an ECC system is scalar point multiplications. Arithmetic operations such as, modular multiplication, inversion, and addition in Galois Fields (GF) operands are needed to perform this task. This paper proposes an architecture for these operations on GF(2(m)) operands, which could be used for various operands sizes without modifying or reconfiguring the underlying hardware. The architecture also uses power and/or clock gating techniques in order to save power in case a smaller key size is used. A 256-bit architecture was synthesized with Synopsys Design Compiler and Cadence SOC Encounter Place & Route tools using 45 nm technology. It runs at 1 GHz clock and consumes 6.6 mW. The total chip area is only 0.069 mm(2). |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1166/jolpe.2011.1150 | JOURNAL OF LOW POWER ELECTRONICS |
Keywords | Field | DocType |
ECC, Public Key Encryption, GF(2(m)), Field Arithmetic, Modular Multiplication, Modular Inversion, Cryptoprocessor | Architecture,Finite field,Arithmetic,Normal basis,Finite field arithmetic,Engineering | Journal |
Volume | Issue | ISSN |
7 | 3 | 1546-1998 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Md. Ibrahim Faisal | 1 | 15 | 3.26 |
| Zahra Jeddi | 2 | 4 | 1.83 |
| Esmaeil Amini | 3 | 4 | 2.16 |
| Magdy Bayoumi | 4 | 190 | 36.91 |