## Customizable elliptic curve cryptosystems (2005)

Venue: | IEEE Transactions on Very Large Scale Integration (VLSI) Systems |

Citations: | 10 - 1 self |

### BibTeX

@ARTICLE{Cheung05customizableelliptic,

author = {Ray C. C. Cheung and Student Member and Nicolas Jean-baptiste Telle and Wayne Luk and Peter Y. K. Cheung and Senior Member},

title = {Customizable elliptic curve cryptosystems},

journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},

year = {2005},

volume = {13},

pages = {1048--1059}

}

### OpenURL

### Abstract

Abstract—This paper presents a method for producing hardware designs for elliptic curve cryptography (ECC) systems over the finite field qp@P A, using the optimal normal basis for the representation of numbers. Our field multiplier design is based on a parallel architecture containing multiple-bit serial multipliers; by changing the number of such serial multipliers, designers can obtain implementations with different tradeoffs in speed, size and level of security. A design generator has been developed which can automatically produce a customised ECC hardware design that meets user-defined requirements. To facilitate performance characterization, we have developed a parametric model for estimating the number of cycles for our generic ECC architecture. The resulting hardware implementations are among the fastest reported: for a key size of 270 bits, a point multiplication in a Xilinx XC2V6000 FPGA at 35 MHz can run over 1000 times faster

### Citations

407 | Introduction to finite fields and their applications - Lidl, Niederreiter - 1986 |

375 | Guide to elliptic curve cryptography
- Hankerson, Menezes, et al.
- 2004
(Show Context)
Citation Context ...ecommended specific curves for implementations [37] and the IEEE has provided detailed specification for the choices of private key length and fields [42]. ECC research has been extensively conducted =-=[19]-=-, [32] and it can be first divided into two groups depending on the underlying field representation: prime field, and binary field, . Two bases, Optimal Normal Basis and Polynomial Basis are commonly ... |

150 | software implementation of elliptic curve cryptographic over binary fields,” proceedings of workshop cryptography hardware embedded system
- Hankerson, Menezes
- 2000
(Show Context)
Citation Context ...es. Fast point multiplication requires efficient field multiplication, inversion [20], squaring and an efficient coordinate system [27]. In recent years, there has been much research in software [8], =-=[18]-=- and hardware [39], [40] for both and focusing on the performance of point multiplication, and it is obvious that a fast point multiplication design is necessary and crucial. The first ECC hardware im... |

92 |
S.: A fast algorithm for computing multiplicative inverses in GF (2 m ) using normal bases
- Itoh, Tsujii
- 1988
(Show Context)
Citation Context ...st squaring. A recent study [13] reports that ONB ECC hardware design can outperform the same design using PB by 27 times. Fast point multiplication requires efficient field multiplication, inversion =-=[20]-=-, squaring and an efficient coordinate system [27]. In recent years, there has been much research in software [8], [18] and hardware [39], [40] for both and focusing on the performance of point multip... |

65 | A high-performance reconfigurable elliptic curve processor for GF(2 m
- Orlando, Paar
- 2000
(Show Context)
Citation Context ...tiplication requires efficient field multiplication, inversion [20], squaring and an efficient coordinate system [27]. In recent years, there has been much research in software [8], [18] and hardware =-=[39]-=-, [40] for both and focusing on the performance of point multiplication, and it is obvious that a fast point multiplication design is necessary and crucial. The first ECC hardware implementation [1] i... |

65 |
Implementing Elliptic Curve Cryptography
- Rosing
- 1999
(Show Context)
Citation Context ...d, pipelined, and parallel field multiplier design. using normal basis and the product is another element in the same field, then where , and the coefficients of element , can be expressed as follows =-=[45]-=-: The ’s are the elements of the multiplication matrix , which are either 0 or 1 [45]. An optimal normal basis means that the number of nonzero is minimized. Since most of the values are zero, the sum... |

56 |
VLSI architectures for computation in Galois fields
- Mastrovito
- 1991
(Show Context)
Citation Context ...ous hardware work includes: the first ASIC implementation with Motorola M68008 microcontroller [1], reconfigurable finite-field multiplier [22], ASIC designs for field operations over specific fields =-=[29]-=-, an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], [17], [24], [2... |

54 | Software implementation of the NIST elliptic curves over prime field
- Brown, Hankerson, et al.
- 2001
(Show Context)
Citation Context ...7 times. Fast point multiplication requires efficient field multiplication, inversion [20], squaring and an efficient coordinate system [27]. In recent years, there has been much research in software =-=[8]-=-, [18] and hardware [39], [40] for both and focusing on the performance of point multiplication, and it is obvious that a fast point multiplication design is necessary and crucial. The first ECC hardw... |

53 |
Applications of Finite Fields
- Menezes, Blake, et al.
- 1993
(Show Context)
Citation Context ...re and hardware implementation. For instance, squaring is easier in NB than in PB, while inversion in NB is slower than in PB. The underlying arithmetic of both PB and NB has been extensively studied =-=[31]-=- and the corresponding high-performance multipliers [44], [49] are also reported. We first introduce field multiplication for normal basis in this section, and describe the architecture of our field m... |

50 |
Computational method and apparatus for finite field arithmetic
- Massey, Omura
- 1986
(Show Context)
Citation Context ... multiplier architecture is based on having copies of an -bit multiplier operating in parallel. Fig. 1 shows the datapath of our field multiplier, which is inspired by a nonparameterised architecture =-=[30]-=-, [50]. The wiring block is auto1050 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 13, NO. 9, SEPTEMBER 2005 Fig. 2. Example of a wiring block when � aSand � aI. matically ge... |

41 |
Specifications for Public-Key Cryptography
- Standard
- 2000
(Show Context)
Citation Context ...ical information [9]. For instance, the NIST has recommended specific curves for implementations [37] and the IEEE has provided detailed specification for the choices of private key length and fields =-=[42]-=-. ECC research has been extensively conducted [19], [32] and it can be first divided into two groups depending on the underlying field representation: prime field, and binary field, . Two bases, Optim... |

36 | Elliptic curve cryptography on smartcards without coprocessors
- Woodbury, Bailey, et al.
- 2000
(Show Context)
Citation Context ...a M68008 microcontroller [1], reconfigurable finite-field multiplier [22], ASIC designs for field operations over specific fields [29], an ECC implementation on the 8051 microprocessor in smart cards =-=[53]-=-, an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], [17], [24], [25], [28], [36], [39]–[41]. In this paper, we aim at optimising the fie... |

35 | K.: A scalable dual-field elliptic curve cryptographic processor - Satoh, Takano - 2003 |

31 | Hardware implementation of an elliptic curve processor over GF(p) with montgomery modular multiplier
- Örs, Batina, et al.
- 2005
(Show Context)
Citation Context ...on on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], [17], [24], [25], [28], [36], [39]–=-=[41]-=-. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a customisable and efficient ECC cryptosystem. II... |

31 | The Hessian form of an elliptic curve - Smart - 2001 |

26 | An end-to-end systems approach to elliptic curve cryptography
- Gura, Shantz, et al.
- 2002
(Show Context)
Citation Context ...ic fields [29], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], =-=[17]-=-, [24], [25], [28], [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a customisable... |

26 |
An Efficient Optimal Normal Basis Type II Multiplier
- Sunar, Koc
- 2001
(Show Context)
Citation Context ...er in NB than in PB, while inversion in NB is slower than in PB. The underlying arithmetic of both PB and NB has been extensively studied [31] and the corresponding high-performance multipliers [44], =-=[49]-=- are also reported. We first introduce field multiplication for normal basis in this section, and describe the architecture of our field multiplier in Section IV. Given that we multiply two elements ,... |

24 |
Hardware architectures for public key cryptography
- Batina, Örs, et al.
- 2003
(Show Context)
Citation Context ...ty. I. INTRODUCTION ELLIPTIC curve cryptography (ECC) is a public key cryptography system superior to the well-known RSA cryptography: for the same key size, it gives a higher security level than RSA =-=[3]-=-. ECC has been adopted to a wide spectrum of applications from digital certificates in webserver authentication [36] to embedded processors [51] in wearable devices. This paper presents a scalable met... |

21 |
I.: VLSI architectures for computing multiplications and inverses in GF (2 m
- Wang, Troung, et al.
- 1985
(Show Context)
Citation Context ...plier architecture is based on having copies of an -bit multiplier operating in parallel. Fig. 1 shows the datapath of our field multiplier, which is inspired by a nonparameterised architecture [30], =-=[50]-=-. The wiring block is auto1050 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 13, NO. 9, SEPTEMBER 2005 Fig. 2. Example of a wiring block when � aSand � aI. matically generate... |

19 | Elliptic curve cryptosystems on reconfigurable hardware - Rosner - 1998 |

18 | A reconfigurable system on chip implementation for elliptic curve cryptography over GF(2 n - Ernst, Jung, et al. - 2002 |

17 | Rapid prototyping for hardware accelerated elliptic curve public key cryptosystems - Ernest, Klupsch, et al. - 2001 |

17 | Elliptic curve scalar multiplier design using FPGAs - Gao, Shrivastava, et al. - 1999 |

17 | Generic Implementations of Elliptic Curve Cryptography using Partial Reduction - Gura, Eberle, et al. |

17 | A microcoded elliptic curve processor using FPGA technology
- Leong, Leung
(Show Context)
Citation Context ...9], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], [17], [24], =-=[25]-=-, [28], [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a customisable and efficie... |

17 | Parallel Multipliers Based on Special Irreducible Pentanomials
- Rodrı´guez-Henrı´quez, Koc
- 2003
(Show Context)
Citation Context ...s easier in NB than in PB, while inversion in NB is slower than in PB. The underlying arithmetic of both PB and NB has been extensively studied [31] and the corresponding high-performance multipliers =-=[44]-=-, [49] are also reported. We first introduce field multiplication for normal basis in this section, and describe the architecture of our field multiplier in Section IV. Given that we multiply two elem... |

16 |
A.: High performance FPGA based elliptic curve cryptographic co-processor
- Lutz, Hasan
(Show Context)
Citation Context ... ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], [17], [24], [25], =-=[28]-=-, [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a customisable and efficient ECC... |

16 | Efficient Software Implementation for Finite Field Multiplication in 32 Basis - Ning, Yin - 2001 |

14 |
A fast elliptic curve cryptosystem
- Agnew, Mullin, et al.
- 1989
(Show Context)
Citation Context ... [39], [40] for both and focusing on the performance of point multiplication, and it is obvious that a fast point multiplication design is necessary and crucial. The first ECC hardware implementation =-=[1]-=- is presented in 1989. Previous hardware work includes: the first ASIC implementation with Motorola M68008 microcontroller [1], reconfigurable finite-field multiplier [22], ASIC designs for field oper... |

13 | Reconfigurable implementation of elliptic curve crypto algorithms
- Bednara, Daldrup, et al.
- 2002
(Show Context)
Citation Context ...ver specific fields [29], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including =-=[5]-=-, [6], [17], [24], [25], [28], [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a c... |

13 | An energy-efficient efficient reconfigurable public-key cryptography processor - Goodman, Chandrakasan - 2001 |

11 | Cryptography in embedded systems: An overview (invited paper
- Wollinger, Paar
(Show Context)
Citation Context ...same key size, it gives a higher security level than RSA [3]. ECC has been adopted to a wide spectrum of applications from digital certificates in webserver authentication [36] to embedded processors =-=[51]-=- in wearable devices. This paper presents a scalable method for producing hardware designs for ECC systems over binary field [26], using the optimal normal basis (ONB) [34] for the representation of n... |

9 |
A Reconfigurable Coprocessor for Finite Field Multiplication
- Jung, Madlener, et al.
- 2002
(Show Context)
Citation Context ...t ECC hardware implementation [1] is presented in 1989. Previous hardware work includes: the first ASIC implementation with Motorola M68008 microcontroller [1], reconfigurable finite-field multiplier =-=[22]-=-, ASIC designs for field operations over specific fields [29], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA imple... |

7 | Flexible hardware design for RSA and elliptic curve cryptosystems - Batina, Bruin-Muurling, et al. |

7 | Tradeoff analysis of FPGA based elliptic curve cryptosystems
- Bednara, Daldrup, et al.
(Show Context)
Citation Context ...pecific fields [29], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], =-=[6]-=-, [17], [24], [25], [28], [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a custom... |

7 | Hardware/software co-design of an elliptic curve public-key cryptosystem - Janssens, Thomas, et al. - 2001 |

7 | Efficient algorithms for elliptic curve cryptosystems on embedded systems - WOODBURY |

6 |
Fully Parameterizable Elliptic Curve Cryptography Processor over GF (2 m
- Kerins, Popovici, et al.
(Show Context)
Citation Context ...lds [29], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device [43], and recent FPGA implementations for ECC designs including [5], [6], [17], =-=[24]-=-, [25], [28], [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting state-of-the-art algorithm for point multiplication, to build a customisable and e... |

6 | Elliptic curve cryptography on smart cards
- Pietiläinen
- 2000
(Show Context)
Citation Context ...inite-field multiplier [22], ASIC designs for field operations over specific fields [29], an ECC implementation on the 8051 microprocessor in smart cards [53], an ECC processor on a smart card device =-=[43]-=-, and recent FPGA implementations for ECC designs including [5], [6], [17], [24], [25], [28], [36], [39]–[41]. In this paper, we aim at optimising the field multiplier for normal basis and adopting st... |

3 |
Implementation of elliptic curve cryptosystems on a reconfigurable computer
- Nguyen, Gaj, et al.
- 2003
(Show Context)
Citation Context ...n RSA cryptography: for the same key size, it gives a higher security level than RSA [3]. ECC has been adopted to a wide spectrum of applications from digital certificates in webserver authentication =-=[36]-=- to embedded processors [51] in wearable devices. This paper presents a scalable method for producing hardware designs for ECC systems over binary field [26], using the optimal normal basis (ONB) [34]... |

2 |
Optimal normal bases in qp
- Mullin, Onyszchuk, et al.
- 1988
(Show Context)
Citation Context ...[36] to embedded processors [51] in wearable devices. This paper presents a scalable method for producing hardware designs for ECC systems over binary field [26], using the optimal normal basis (ONB) =-=[34]-=- for the representation of numbers. Our design is based on a field multiplier architecture with multiple -bit serial multipliers operating in parallel. An unique feature of our approach is a design ge... |

2 | Implementation of elliptic cruve cryptographic coprocessor over GF (2 m ) on an FPGA - Okada, Torii, et al. - 1965 |

1 | implementation of elliptic curve cryptosystem over p - “An - 1993 |

1 |
Elliptic curve cryptography over qp@P A on a reconfigurable computer: Polynomial basis vs. Optimal normal basis representation comparative study
- Gaj, Bajracharya, et al.
- 2004
(Show Context)
Citation Context ...le with NB the irreducible polynomial used in PB is not required. It is known that binary field is more suitable for hardware implementation, and ONB is said to dominate fast squaring. A recent study =-=[13]-=- reports that ONB ECC hardware design can outperform the same design using PB by 27 times. Fast point multiplication requires efficient field multiplication, inversion [20], squaring and an efficient ... |

1 |
Fast multiplication on elliptic curves over qp@P A without precomputation,” Cryptographic Hardware and Embedded Syst
- López, Dahab
- 1999
(Show Context)
Citation Context ...ECC hardware design can outperform the same design using PB by 27 times. Fast point multiplication requires efficient field multiplication, inversion [20], squaring and an efficient coordinate system =-=[27]-=-. In recent years, there has been much research in software [8], [18] and hardware [39], [40] for both and focusing on the performance of point multiplication, and it is obvious that a fast point mult... |

1 |
scalable qp@�A elliptic curve processor architecture for programmable hardware
- “A
(Show Context)
Citation Context ...ation requires efficient field multiplication, inversion [20], squaring and an efficient coordinate system [27]. In recent years, there has been much research in software [8], [18] and hardware [39], =-=[40]-=- for both and focusing on the performance of point multiplication, and it is obvious that a fast point multiplication design is necessary and crucial. The first ECC hardware implementation [1] is pres... |