Breaching Security of Full Round Tiny Encryption Algorithm

Puneet Kumar Kaushal and Rajeev Sobti
Additional contact information
Puneet Kumar Kaushal: Lovely Professional University, Punjab, India
Rajeev Sobti: Lovely Professional University, Punjab, India

International Journal of Information Security and Privacy (IJISP), 2018, vol. 12, issue 1, 89-98

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.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJISP.2018010108 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jisp00:v:12:y:2018:i:1:p:89-98

Access Statistics for this article

International Journal of Information Security and Privacy (IJISP) is currently edited by Yassine Maleh

More articles in International Journal of Information Security and Privacy (IJISP) from IGI Global
Bibliographic data for series maintained by Journal Editor ().