Welcome to the InfoSci Platform
Breaching Security of Full Round Tiny Encryption Algorithm

Breaching Security of Full Round Tiny Encryption Algorithm

Puneet Kumar Kaushal, Rajeev Sobti
Copyright: © 2018 |Volume: 12 |Issue: 1 |Pages: 10
ISSN: 1930-1650|EISSN: 1930-1669|EISBN13: 9781522543060|DOI: 10.4018/IJISP.2018010108
Cite Article Cite Article

MLA

Kaushal, Puneet Kumar, and Rajeev Sobti. "Breaching Security of Full Round Tiny Encryption Algorithm." IJISP vol.12, no.1 2018: pp.89-98. http://doi.org/10.4018/IJISP.2018010108

APA

Kaushal, P. K. & Sobti, R. (2018). Breaching Security of Full Round Tiny Encryption Algorithm. International Journal of Information Security and Privacy (IJISP), 12(1), 89-98. http://doi.org/10.4018/IJISP.2018010108

Chicago

Kaushal, Puneet Kumar, and Rajeev Sobti. "Breaching Security of Full Round Tiny Encryption Algorithm," International Journal of Information Security and Privacy (IJISP) 12, no.1: 89-98. http://doi.org/10.4018/IJISP.2018010108

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Tiny encryption algorithm is a 64-bit block cipher designed by Wheeler and Needham in 1994 and attracted much of its attention due to its capability of reducing the hardware cost. In this paper, we introduced coincidence count attack at bit level, a kind of known-plaintext attack and evaluated the resistance of TEA to withstand with it. We also examined confrontation of full round TEA against bit sum attack. Furthermore, we introduced a modest algorithm based on coincidence count and bit sum concept that makes it easy to find relevant plaintext corresponding to an arbitrary cipher text with a probability of 0.93. We also presented how cipher text originated from tiny encryption algorithm can be distinguished from a random permutation of binary sequence.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.