|
INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016 open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15 |
Imp Links for Author
Imp Links for Reviewer
Research Area
Subscribe IJSDR
Visitor Counter
Copyright Infringement Claims
Indexing Partner
|
Published Paper Details
|
|
| Paper Title: | Exploring the Tiny Encryption Algorithm: A Comparative Analysis of Parallel and Sequential Computation |
| Authors Name: | Mansour Al-Hlalat |
| Unique Id: | IJSDR2307101 |
| Published In: | Volume 8 Issue 7, July-2023 |
| Abstract: | The Tiny Encryption Algorithm (TEA) is renowned for its strong security and impressive speed, making it highly suitable for lightweight encryption needs in diverse applications. This research paper delves into the investigation of TEA's efficiency by examining the influence of various execution parameters. The study specifically focuses on exploring the impact of factors such as data size, processing type, and the number of processing units in the execution machine on TEA's performance. Through this analysis, valuable insights can be gained to optimize TEA's usage and enhance its overall effectiveness. In addition, this paper introduces a robust model designed to efficiently execute the TEA on parallel machines with large-scale data. The proposed model utilizes a master processor for data splitting and gathering, along with multiple slave processors for executing distributed data. To assess the performance of the TEA algorithm, several experiments were conducted, evaluating factors such as efficiency, execution time, and speedup. These experiments involved varying numbers of plaintexts and key sizes, conducted on both serial and parallel machines, including different cores systems. The TEA algorithm was implemented in C/C++ language using the Message Passing Interface (MPI) library and tested on the high-performance IMAN1 super-computer. The study reveals the significant value of parallel systems in enhancing the overall efficiency of TEA (Tiny Encryption Algorithm), thereby playing a crucial role in the development of secure embedded systems within a short timeframe. The findings demonstrate that parallel processing significantly boosts the computational power of encryption algorithms by distributing computational tasks across multiple processors or cores. Remarkably, the study achieves a substantial decrease in execution time, with a record of 13.258 seconds for a 512k plaintext and 512 key size on a 128-CPU machine. Additionally, the study showcases impressive speed-up across various approaches, highlighting the impactful achievements that fuel further research in this field. |
| Keywords: | Tiny Encryption Algorithm, Parallel Machines, Encryption, Computation, Fast Software Encryption |
| Cite Article: | "Exploring the Tiny Encryption Algorithm: A Comparative Analysis of Parallel and Sequential Computation", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.8, Issue 7, page no.693 - 702, July-2023, Available :http://www.ijsdr.org/papers/IJSDR2307101.pdf |
| Downloads: | 000338536 |
| Publication Details: | Published Paper ID: IJSDR2307101 Registration ID:207779 Published In: Volume 8 Issue 7, July-2023 DOI (Digital Object Identifier): http://doi.one/10.1729/Journal.35208 Page No: 693 - 702 Publisher: IJSDR | www.ijsdr.org ISSN Number: 2455-2631 |
|
Click Here to Download This Article |
|
| Article Preview | |
|
|
|
Major Indexing from www.ijsdr.org
| Google Scholar | ResearcherID Thomson Reuters | Mendeley : reference manager | Academia.edu |
| arXiv.org : cornell university library | Research Gate | CiteSeerX | DOAJ : Directory of Open Access Journals |
| DRJI | Index Copernicus International | Scribd | DocStoc |
Track Paper
Important Links
Conference Proposal
ISSN
 |
 |
DOI (A digital object identifier)
  Providing A digital object identifier by DOI How to GET DOI and Hard Copy Related |
Open Access License Policy
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
 |
 |
 |
Social Media
Indexing Partner |
|||
| Copyright © 2024 - All Rights Reserved - IJSDR | |||
Facebook Twitter Instagram LinkedIn