#TITLE_ALTERNATIVE#
<b></i>Abstract:</b><i><p align=\"justify\"><br />Elliptic Curves Cryptosystem is public key cryptosvstem+ which uses elliptic curve group. The elliptic curve is usually defined over finite field.<br /><p align=\"justify\"><br /&...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/5781 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | <b></i>Abstract:</b><i><p align=\"justify\"><br />Elliptic Curves Cryptosystem is public key cryptosvstem+ which uses elliptic curve group. The elliptic curve is usually defined over finite field.<br /><p align=\"justify\"><br />There are several alternatives of field and their representation that can be used. Between these alternatives, F<sub>2</sub>n with subfield extension representation could be an interesting alternative. As the subfield and its extension we chose optimal normal basis.<br /><p align=\"justify\"><br />To constrict this elliptic curve group we need multiplication, addition and inversion in the field Multiplication is the most expensive operation. There are two alternatives to construct this operation in optimal normal basis. These two are Massey-Omura multiplier and Agnew et a! multiplier. Both alternatives need n clocks, which n is the lenght of Ike key. Inversion need more clock than multiplication since. it construct by performing several multiplication and squaring. So it evil/ be worth if we can perform multiplication faster.<br /><p align=\"justify\"><br />In this thesis, I try to implement field operation in F<sub>2</sub>11x14 as extension field of subfield F<sub>2</sub>11. This scheme gives us faster operation for multiplication and inversion. We conclude that subfield extension can become advantageous alternative in the trade of benveen speed and area.<br /> |
|---|