Article Fingerprint
ReserarchID
CSTD51D0
Embedded Processors have 2 main constraints [1] : Memory and Processing Power. Encryption algorithm running on such processors should be specially customized to overcome these 2 constraints. AES [2] is a well-known standard algorithm for encryption but its memory and processing power requirements are very high. This paper proposes modifications to AES to optimize it to overcome above 2 constraints.
Dr.Suhas J Manangi. 1970. \u201cSimplified AES for Low Memory Embedded Processors\u201d. Global Journal of Computer Science and Technology GJCST Volume 10 (GJCST Volume 10 Issue 14): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 148
Country: India
Subject: Global Journal of Computer Science and Technology
Authors: Dr.Suhas J Manangi, Parul Chaurasia, Mahendra Pratap Singh (PhD/Dr. count: 1)
View Count (all-time): 102
Total Views (Real + Logic): 20822
Total Downloads (simulated): 10826
Publish Date: 1970 01, Thu
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
Embedded Processors have 2 main constraints [1] : Memory and Processing Power. Encryption algorithm running on such processors should be specially customized to overcome these 2 constraints. AES [2] is a well-known standard algorithm for encryption but its memory and processing power requirements are very high. This paper proposes modifications to AES to optimize it to overcome above 2 constraints.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.