Study on Cryptanalysis of the Tiny Encryption Algorithm
Rajashekarappa1, K. M. Sunjiv Soyjaudah2, Sumithra Devi K. A.3
1Rajashekarappa, Dept. of Computer Science and Engineering, JSSATE, Mauritius. Research Scholar, Jain University, Bangalore, Karnataka, India.
2Dr. K M Sunjiv Soyjaudah, Dept. of Electrical and Electronic Engineering, University of Mauritius, Reduit, Mauritius.
3Dr. Sumithra Devi K A, Director, Department of Master of Computer Application, R. V. College of Engineering, Bangalore, India.
Manuscript received on 07 February 2013 | Revised Manuscript received on 21 February 2013 | Manuscript Published on 28 February 2013 | PP: 88-91 | Volume-2 Issue-3, February 2013 | Retrieval Number: C0428022313/2013©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper we present the Study on a Tiny Encryption Algorithm. There is a requirement to specify cryptographic strength in an objective manner rather than describing it using subjective descriptors such as weak, strong, acceptable etc. Such metrics are essential for describing the characteristics of cryptographic products and technologies. Towards this objective, we use two metrics called the Strict Plaintext Avalanche Criterion (SPAC) and the Strict Key Avalanche Criterion (SKAC) mentioned in our study that the strength of popular ciphers such as DES and TEA. A related issue of significance in the context of cryptographic applications is the quality of random number generators which need to pass certain tests. In this Paper, we expose DES and TEA to some of the standard random number generator tests.
Keywords: Data Encryption Standard, Tiny Encryption Algorithm.
Scope of the Article: Encryption Methods and Tools