An optimization of tree topology based parallel cryptography

DOI10.1155/2012/871091MaRDI QIDQ1955306zbMATH OpenOpenAlexWikidataFDO

Authors Masumeh Damrudi, Norafida Ithnin

Publication date 11 June 2013

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/871091

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

Summary: Public key cryptography has become of vital importance regarding the rapid development of wireless technologies. The RSA is one of the most important algorithms for secure communications in public-key cryptosystems. Since the RSA is expensive in terms of computational task which is modular exponentiation, parallel processing and architecture is a reasonable solution to speedup RSA operations. In this paper, taking into account pipelining and optimization, we improve throughput and efficiency of the TRSA method, a parallel architecture solution for RSA security based on tree topology. The optimization and pipelining of the tree based architecture increases its efficiency and throughput. The experimental results demonstrate that these pipelined and optimized approaches outperform the main TRSA.

Recommendations

• Parallel implementation of the rsa public-key cryptosystem
• Fast parallel exponentiation algorithm for RSA public-key cryptosystem
• scientific article; zbMATH DE number 1983211
• scientific article; zbMATH DE number 2118995
• A systolic, high speed architecture for an RSA cryptosystem

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• An optimization of tree topology based parallel cryptography
• Energy Analysis of RSA and ELGAMAL Algorithms for Wireless Sensor Networks
• FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• scientific article; zbMATH DE number 2171995 (Why is no real title available?)
• New iterative algorithms for modular multiplication
• Parallel depth first search. II: Analysis
• Parallel modular exponentiation using load balancing without precomputation

Cited in

(2)

• An optimization of tree topology based parallel cryptography
• Information Security and Cryptology - ICISC 2003

This page was built for publication: An optimization of tree topology based parallel cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955306)