Hinweis zum Urheberrecht| Allgemeine Informationen | FAQ
Beim Zitieren dieses Dokumentes beziehen Sie sich bitte immer auf folgende URN: urn:nbn:de:hbz:5N-09601

Mathematisch-Naturwissenschaftliche Fakultät - Jahrgang 2007


Titel Efficient Implementation of Elliptic Curve Cryptography on FPGAs
Autor Jamshid Shokrollahi
Publikationsform Dissertation
Abstract This work presents the design strategies of an FPGA-based elliptic curve co-processor. Elliptic curve cryptography is an important topic in cryptography due to its relatively short key length and higher efficiency as compared to other well-known public key crypto-systems like RSA. The most important contributions of this work are:
- Analyzing how different representations of finite fields and points on elliptic curves effect the performance of an elliptic curve co-processor and implementing a high performance co-processor.
- Proposing a novel dynamic programming approach to find the optimum combination of different recursive polynomial multiplication methods. Here optimum means the method which has the smallest number of bit operations.
- Designing a new normal-basis multiplier which is based on polynomial multipliers. The most important part of this multiplier is a circuit of size $O(n \log n)$ for changing the representation between polynomial and normal basis.
Komplette Version pdf-Dokument (1 MB) Hier können Sie den Adobe Acrobat Reader downloaden

© Universitäts- und Landesbibliothek Bonn | Veröffentlicht: 2007