Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/13598
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KUMAR, RAMAN | - |
dc.date.accessioned | 2011-04-13T09:55:25Z | - |
dc.date.available | 2011-04-13T09:55:25Z | - |
dc.date.issued | 2009-11-26 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/13598 | - |
dc.description | ME THESIS | en_US |
dc.description.abstract | The file securing system requires a Tiny Encryption Algorithm (TEA). It basically consist of using a combination of XOR, ADD and SHIFT operations on file blocks to encrypt is using key bits and some junk bits. This algorithm is highly efficient and can satisfy need for a user-friendly encryption system that can be used at homes and offices. The Tiny Encryption Algorithm (TEA) is a block cipher encryption algorithm that is very simple to implement, has fast execution time, and takes minimal storage space. The Tiny Encryption Algorithm (TEA) is a cryptographic algorithm designed to minimize memory footprint and maximize speed. It is a Feistel type cipher that uses operations from mixed (orthogonal) algebraic groups. This thesis presents the cryptanalysis of the Tiny Encryption Algorithm. In this thesis proposed to inspect the most common methods in the cryptanalysis of a block cipher algorithm. TEA seems to be highly resistant to differential cryptanalysis, and achieves comple... | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TD604;68 | - |
dc.subject | Tiny Encryption | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Securing System | en_US |
dc.title | IMPLEMENTATION OF TINY ENCRYPTION ALGORITHM FOR SECURING SYSTEM FILE | en_US |
Appears in Collections: | Faculty Publications Computer Technology & Applications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
M.TECH+MAJOR+RAMAN+2009.pdf | 1.21 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.