GENERALIZATIONS OF n-TERM KARATSUBA LIKE FORMULAE IN GF(2n) WITH NAYK ALGORITHM
There have been many researches that were developed to reduce multiplication operations in polynomial multiplier in GF(2n). This is important because of its connection with the efficient implementation in restricted devices, such as in elliptic curve cryptography. Two of them are the researches cond...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/23173 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |