## Abstract

Elliptic Curve Point Multiplication i. The main operation employed in all elliptic curve cryptosystems, as it form. The basis oy the Elliptic Curve Discrete Logarithm Problem. Therefore. The efficient realization of an Elliptic Curve Point Multiplier is of fundamental importance, as its performance is decisive for the performance oy the overall cryptosystem. This work present. The first practical implementation of an Elliptic Curve Point Multiplier in GF(2^{n}) using Polynomial Residue Arithmetic. Unlik. The typical representation of GF(2^{n}) elements as polynomials in GF(2)[x] of degree at most n -1, data are represented as their remainder modulo a set of L pairwlse prime polynomials m1, m2,...., m_{L} of degree w and such that Lw > 2n. The methodology for incorporating Polynomial Residue Arithmetic i. The elliptic curve point addition and doubling algorithms, as well at the VLSI architecture oy the proposed point multiplier are analyzed, thus forming an interesting alternative to Elliptic Curve Cryptography realization.

Original language | British English |
---|---|

Title of host publication | 2009 16th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2009 |

Pages | 980-983 |

Number of pages | 4 |

DOIs | |

State | Published - 2009 |

Event | 2009 16th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2009 - Yasmine Hammamet, Tunisia Duration: 13 Dec 2009 → 16 Dec 2009 |

### Publication series

Name | 2009 16th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2009 |
---|

### Conference

Conference | 2009 16th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2009 |
---|---|

Country/Territory | Tunisia |

City | Yasmine Hammamet |

Period | 13/12/09 → 16/12/09 |

## Fingerprint

Dive into the research topics of 'Elliptic curve point multiplication in GF(2^{n}) using polynomial residue arithmetic'. Together they form a unique fingerprint.