Lara, Pedro ; Borges, Fábio ; Portugal, Renato ; Nedjah, Nadia (2012)
Parallel modular exponentiation using load balancing without precomputation.
In: Journal of Computer and System Sciences, 78 (2)
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
The modular exponentiation operation of the current algorithms for asymmetric cryptography is the most expensive part in terms of computational cost. The RSA algorithm, for example, uses the modular exponentiation algorithm in encryption and decryption procedure. Thus, the overall performance of those asymmetric cryptosystems depends heavily on the performance of the specific algorithm used for modular exponentiation. This work proposes new parallel algorithms to perform this arithmetical operation and determines the optimal number of processors that yields the greatest speedup. The optimal number is obtained by balancing the processing load evenly among the processors. Practical implementations are also performed to evaluate the theoretical proposals.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2012 |
| Autor(en): | Lara, Pedro ; Borges, Fábio ; Portugal, Renato ; Nedjah, Nadia |
| Art des Eintrags: | Bibliographie |
| Titel: | Parallel modular exponentiation using load balancing without precomputation |
| Sprache: | Englisch |
| Publikationsjahr: | März 2012 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Journal of Computer and System Sciences |
| Jahrgang/Volume einer Zeitschrift: | 78 |
| (Heft-)Nummer: | 2 |
| Kurzbeschreibung (Abstract): | The modular exponentiation operation of the current algorithms for asymmetric cryptography is the most expensive part in terms of computational cost. The RSA algorithm, for example, uses the modular exponentiation algorithm in encryption and decryption procedure. Thus, the overall performance of those asymmetric cryptosystems depends heavily on the performance of the specific algorithm used for modular exponentiation. This work proposes new parallel algorithms to perform this arithmetical operation and determines the optimal number of processors that yields the greatest speedup. The optimal number is obtained by balancing the processing load evenly among the processors. Practical implementations are also performed to evaluate the theoretical proposals. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik > Telekooperation 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 16 Mär 2015 16:39 |
| Letzte Änderung: | 17 Mär 2015 08:05 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum