Abstract
dc:descriptionIn this PhD dissertation the cryptographic schemes of RSA and elliptic curve cryptography were studied extensively in order to propose design methodologies for those schemes that are efficient in terms of computation speed and employed hardware resources. In the proposed methodologies special attention is given in the optimization of finite field arithmetic operations employed in public key cryptography. The most widely used such fields are the prime fields or GF(p) and the binary extension fields or GF(2ᵏ). Concerning GF(p) arithmetic an optimized version of Montgomery modulo multiplication algorithm is proposed for performing modular multiplication that employs Carry Save redundant logic and value precomputation. The resulting architecture is used in a modular exponentiation unit (which is the basic arithmetic operation of RSA. The proposed unit achieves much better results in terms of computation speed and utilized hardware resources when compared to other well known similar designs. Concerning arithmetic in GF(2ᵏ) algorithms and architectures are proposed for versatile design and inversion when polynomial basis representation of the GF(2ᵏ) is employed. Also, a multiplication design methodology is proposed along with resulting sequential (SMPO) and parallel hardware architectures when normal basis representation of the GF(2ᵏ) is chosen. Finally, on elliptic curve arithmetic defined over GF(p) or GF(2ᵏ) the proposed architectures for those fields were used in order to propose a competitive elliptic curve point operation arithmetic unit. The major problem of such a unit is the extensive cost in hardware resources and computation delay of finite field inversion operation. Using the architectural structure proposed in the PhD dissertation for inversion/multiplication in GF(2ᵏ) (multiplication/inversion unit) the design cost can be minimized.
Degree
thesis:*- Grantor dc:publisher
- University of Patras
- Year dc:date
- 2008
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Fournaris, Apostolos
- Φουρνάρης, Απόστολος
Subjects
dc:subject × 19- Σχεδιασμός υλικών VLSI
- Κρυπτογραφία δημόσιου κλειδιού
- Κρυπτογραφία ελλειπτικών καμπυλών
- Εφαρμογές σε πεπερασμένα σώματα
- Αριθμητική υπολογιστών
- Hardware design VLSI
- Public key cryptography
- RSA
- Elliptic curves cryptography
- Applications in finite fields
- Computer arithmetics
- Φυσικές Επιστήμες
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Επιστήμες Μηχανικού και Τεχνολογία
- Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ
- Natural Sciences
- Computer and Information Sciences
- Engineering and Technology
- Electrical Engineering, Electronic Engineering, Information Engineering
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/27746