Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Design and implementation of high-speed algorithms for public-key cryptosystems
Dissertation (MEng (Electronics))--University of Pretoria, 2006.
Saved in:
| Other Authors: | |
|---|---|
| Format: | Thesis |
| Published: |
University of Pretoria
2013
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613652128890880 |
|---|---|
| access_status_str | Open Access |
| author2 | Penzhorn, W.T. |
| author_browse | Penzhorn, W.T. |
| author_facet | Penzhorn, W.T. |
| collection | Thesis |
| dc_rights_str_mv | © 2005, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. |
| description | Dissertation (MEng (Electronics))--University of Pretoria, 2006. |
| format | Thesis |
| id | oai:repository.up.ac.za:2263/25353 |
| institution | University of Pretoria (South Africa) |
| last_indexed | 2026-06-10T12:39:32.610Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository |
| publishDate | 2013 |
| publishDateRange | 2013 |
| publishDateSort | 2013 |
| publisher | University of Pretoria |
| publisherStr | University of Pretoria |
| record_format | dspace |
| source_str | UPSpace — University of Pretoria Institutional Repository |
| spelling | oai:repository.up.ac.za:2263/25353 Design and implementation of high-speed algorithms for public-key cryptosystems Penzhorn, W.T. josephg1@telkom.co.za Joseph, George Modular multiplication Modular reduction Rsa decryption Montgomery reduction Karatsuba-ofman multiplication Addition chains Chinese remainder theorem Public-key cryptosystems Rsa Modular exponentiation UCTD Dissertation (MEng (Electronics))--University of Pretoria, 2006. The aim of this dissertation is to improve computational efficiency of modular exponentiation-based public-key cryptosystems. The operational speed of these public-key cryptosystems is largely determined by the modular exponentiation operation of the form A = ge mod m where g is the base, e is the exponent and m is the modulus. The required modular exponentiation is computed by a series of modular multiplications. Optimized algorithms are required for various platforms, especially for lower-end platforms. These require the algorithms to be efficient and consume as little resources as possible. In these dissertation algorithms for integer multiplication, modular reduction and modular exponentiation, was developed and implemented in software, as required for public-key cryptography. A detailed analysis of these algorithms is given, as well as exact measurement of the computational speed achieved by each algorithm. This research shows that a total speed improvement of 13% can be achieved on existing modular exponentiation based public-key cryptosystems, in particular for the RSA cryptosystem. Three novel approaches are also presented for improving the decryption speed efficiency of the RSA algorithm. These methods focus on the selection of the decryption exponent by careful consideration of the difference between the two primes p and q. The resulting reduction of the decryption exponent improves the decryption speed by approximately 45%. Electrical, Electronic and Computer Engineering unrestricted 2013-09-06T20:55:20Z 2005-06-09 2013-09-06T20:55:20Z 2005-03-15 2006-06-09 2005-06-09 Dissertation Joseph, G 2005, Design and implementation of high-speed algorithms for public-key cryptosystems, MEng dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/25353 > http://hdl.handle.net/2263/25353 http://upetd.up.ac.za/thesis/available/etd-06092005-122043/ © 2005, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf University of Pretoria |
| spellingShingle | Modular multiplication Modular reduction Rsa decryption Montgomery reduction Karatsuba-ofman multiplication Addition chains Chinese remainder theorem Public-key cryptosystems Rsa Modular exponentiation UCTD Design and implementation of high-speed algorithms for public-key cryptosystems |
| title | Design and implementation of high-speed algorithms for public-key cryptosystems |
| title_full | Design and implementation of high-speed algorithms for public-key cryptosystems |
| title_fullStr | Design and implementation of high-speed algorithms for public-key cryptosystems |
| title_full_unstemmed | Design and implementation of high-speed algorithms for public-key cryptosystems |
| title_short | Design and implementation of high-speed algorithms for public-key cryptosystems |
| title_sort | design and implementation of high speed algorithms for public key cryptosystems |
| topic | Modular multiplication Modular reduction Rsa decryption Montgomery reduction Karatsuba-ofman multiplication Addition chains Chinese remainder theorem Public-key cryptosystems Rsa Modular exponentiation UCTD |
| url | http://hdl.handle.net/2263/25353 http://upetd.up.ac.za/thesis/available/etd-06092005-122043/ |