Earticle

초록

영어

This paper proposes a new Text Encryption (N-TEA) Algorithm that compresses and encrypts input text before transmitting it to the receiver. The N-TEA algorithm uses a predefined static dictionary providing codewords of only 12 bits as maximum length, and occupying less than 16 Kbytes. The predefined dictionary stores characters, symbols, and few frequently used words. The dictionary is hashed, generating encrypted dictionary of large number of possibilities that is almost impossible to be discovered or broken without knowing the right hashing function. Several hashing functions could be applied for exchanging text data between parties. Although dictionary based text coding is not new, the proposed work is novel, very simple, and generic, having three main advantages over those in the literature. First, the used dictionary is for characters and symbols, instead of the complete dictionary of words and encryption is for the dictionary itself, instead of the original text. Second, no private/public keys are transmitted through communication channels, providing secured data exchange. Third, transmitted data is reduced by at least 25% of its original size at the same time the text is encrypted, transmitting compressed and encrypted data. Thus, the proposed N-TEA algorithm is adequate for real-time applications, resisting many kinds of attacks such as the Brute Force, Meet-in-the-Middle, and Birthday attacks.

목차

Abstract
 1. Introduction
 2. Literature Survey
 3. The Proposed N-TEA Encryption Algorithm
  3.1. The ‘A-M’ Framework
  3.2. A Complete Encryption Example
  3.3. User Customized N-TEA
  3.4. N-TEA Resisting Different Attacks
 4. Conclusion
 References

키워드

저자

• Ahmed Mokhtar A. Mansour [ CTO, Nile Innovations, Cairo, Egypt ]
• Mona A. M. Fouad [ Computers & Systems Department, National Telecommunication Institute Cairo, Egypt ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605