tofan arta - Academia.edu (original) (raw)

Papers by tofan arta

This paper proposes a new Text Encryption (N-TEA) Algorithm that compresses and encrypts input te... more 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.

This paper proposes a new Text Encryption (N-TEA) Algorithm that compresses and encrypts input te... more 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.