NIYANTRA Documents
(Make sure you follow all the 3 steps involved in submission. This is only Step 2 of 3. For details, visit http://bit.ly/16iNfUL)
Contact Information
Name of the College : Amrita School of Engineering, Bangalore
Name of the Team Members along with their respective current semester : Anshika Upadhyay (B.Tech, ECE 7th sem), Sompalli Neeharika (B.Tech, ECE 7th sem), Songa Divya (B.Tech, ECE 7th sem)
E-Mail Address & Phone Number of the Team Leader : email id : aulindalive@gmail.com, phone no.: 8904884712, 9945619811
Name of the Faculty Guide : Prof. S. Ravishankar
E-Mail Address & Phone Number of the Faculty Guide : email id: s_ravishankar@blr.amrita.edu, phone no.: 9448046077
Project Information
Project Title: Random Key MTEA Security
Hardware & Software Used: LabVIEW, Matlab
What challenge/problem are you trying to solve through your application:
Design a robust and highly efficient security algorithm that can be used in embedded systems that are security intensive and at the same time critical to operating at very low power and having very less ardware and software overhead.
How does your application solves the above mentioned challenge/problem:
We have used Modified TEA(MTEA) encryption algorithm as the base of this project as it is very efficient, low power consuming and quite strong. We have strengthened the algorithm by introducing randomness in MTEA key, i.e., by avoiding key storage and rather creating pseudo-random function in terms of 'n' (n=no. of systems in communication network) which is known to all systems, so that the key is protected.
Also, we introduce 'Validation'. In this, we verify the systems requesting to join the network. Any system seeking permission to join is required to send a code to the central monitoring system. The code should be unique in terms energy. Default energy Eo is set and each newcoming system must send a code that is integral multiple of Eo*2*pi/n. This is because it's visualised as a circle with constant radius Eo with equally spaced systems as points on the circle. Every two consecutive points are at distance of Eo*2*pi/n and every two random points are at distance of integral multiple of that. This concept looks simple but is derived from Information Coding techniques and ensures uniqueness in identification.
Thus, this scenario strengthens MTEA and makes it ready for security intensive, critical to low power embedded applications like RFID or electronic voting machines to use this. Even other security intensive application like ATMs can use this as it would ensure high level of security.
Description of Project:
Data security has become increasingly inevitable over the past few decades with the overwhelming
need of complex algorithms to encrypt and thus protect the data over communication channels. But the
huge amounts of data also call upon the need to fabricate effective algorithms consuming less power
and having simple implementation not causing unnecessary hardware or software overhead.
This project is aimed at strengthening the existing symmetric key algorithm Modified Tiny Encryption
Algorithm (MTEA) using digital communication techniques. MTEA is a symmetric key algorithm used
in low power systems and is very simple to implement in embedded systems. Thus, it is a preferred
algorithm to use in embedded systems. Although MTEA successfully overcomes the problems
encountered in TEA such as trouble of related keys (that made it an option for use as hash function)
with the help of linear feedback shift register (LFSR) and looks much more attractive than TEA for use
in embedded systems for its increased reliability with the same simplicity of TEA, its use gets limited
because of its symmetric key nature and seemingly relative ease of key cracking. The aim is to
eradicate the problem 'symmetric key' (which is that the same key is used by all systems participating
in the communication setup to encrypt and decrypt the data) by pseudo-randomizing the key and builtin
validation of joining in systems to virtually remove the chances of security break, hence, making this
low-power, extremely simple and incredibly strong algorithm universal for use in multiple system
based security systems such as in networking and electronic voting machines rather than its present two
system use for example in RFID security.
Since this project is based on a simple and effective algorithm such as MTEA that needs just a few
lines of coding and claims to overcome the most nagging problems of symmetric key and proper builtin
validation to ensure the safe, easy and effective implementation of multiple system communication
setup security, it makes a very viable security system that wouldn't be costly and can be used in the
most highly sensitive organizations such as defence to use this for their data security. It is not expected
to get outdated for a very long time since it would be virtually impossible to crack the code for
validation and then to crack the pseudo randomness of the key (if the first task is achieved).
Insert Images Here:
YouTube Link of Video:
Insert the Video here:
http://www.youtube.com/watch?v=hQSHiipYGn8&feature=youtu.be
Please see this video.
