Abel Geo Thomas Jinju K Rajan Jisha krishnamkutty Jisha Mariyam John Tintu Rachel James

Introduction
SMS Sending & Receiving text messages via mobile.

Use- Mobile banking, Mobile payment, Recharge, Mobile

Commerce.
For single message, number of characters-160 Current standard SMS-Non-secure. SMS security To protect the sensitive information.

Risks : security vulnerabilities, unauthorized access.

Thus a new approach is needed to enhance security of the SMS.

SMS structure
SMS - communication service in

SMS cellular network

the mobile communication

system.
SMS service hosted on -SMS

SMS -store and forward

service.
SMS Center (SMSC)delivery

gateway connects-SMS centre.

Point-to-point &broadcast-to-

of text message.
Can receive or transmit SMS at

point mechanism transmitting short messages.

any time.

SMS packets:

Header- identifies the type of

message
Instruction to Air interface Instruction to SMSC Instruction to Phone Instruction to SIM card User Data- the message body

(payload)- displayed on the

recipients mobile device.

Limitations of existing system of sending SMS

SMS travels as plain text Privacy of the SMS contents cannot be guaranteed

Security vulnerabilities
Unauthorized access

The contents are visible to network operator's systems.

The service is insecure. Attacks to the confidentiality, the integrity and nonrepudiation of the messages can arise.

Our approach: To ensure security and cost effectiveness we applied compression and encryption techniques.
Application named ComEn is developed Mobile application-Compresses the message and then

encrypts it before sending.

Physical underlying GSM architecture remains

unchanged.

Requirement Specification
Hardware Requirements
CPU - Pentium III Processor

Software Requirements
Language - Java,J2ME Operating system -

or above
Mobile Processor - ARM11

WINDOWS 7/XP
Mobile Operating System -

processor 434Mhz

Symbian OS
Mobile Platform - CLDC 1.1

and MIDP 2.0 or above

 Nokia Symbian-60 Series mobile phone platform. The mobile application is developed using Netbeans and

programming Java ME language.

Used by Java ME (MIDP) 2.0 enabled phones. Algorithms used:

For compression:
Range encoding

Dictionary method

For encryption
Data Encryption Standard(DES)

Product functions
To provide cost effective delivery of messages. To provide security and privacy for messages. Algorithms are for compression and encryption. Before sending the messages it is compressed to a permissible

limit.
Then it is encrypted using the DES encryption algorithm and

sends.
At the receiver side cipher text is decrypted and decompressed

to get the original message.

DATA FLOW DIAGRAM

Implementation

1.Compression
For reducing cost Minimize the length of SMS- Packing message into one. The average compression efficiency -must be more than 40

percent.
Efficiency=ratio of total to compressed. In order to pack the whole message into 1 message- users use

abbreviations results in strange SMS time consuming.

Better use an algorithm to compress the SMS.

 Algorithm simple, small space-consuming and fast to be

used in a mobile device.

Transmission of compressed data over networks is done in a

transparent way.
Compression/decompression mobile application is needed on

both ends.
Different compression schemes: mainly 2 categories
Dictionary method-Human Interpretive compression method
Lossless compression techniques-Range encoding

Human Interpretive Compression

Word or phrase abbreviation. Simple one-uses Dictionary Reads each particular string from the text message

Replaces each string with a symbol.

Uses symbol table lookup method. Library implemented as a separate package. Librarystores words and their corresponding substitutions. Performance of the algorithm based on the words in the library. No substitution --for words that are absent in the library.

Range Encoding Algorithm

A form of arithmetic coding

Encodes all the symbols of the message into one number

Achieve greater compression ratios. Unlike huffman coding-no problems when handling probabilities that

are not power of two.

Central concept:
Initially :

Large range of integers are given

Probability estimation of symbols.

Initial range divided into sub-ranges size proportional to probability

of symbol.

 Each symbol of the message can then be encoded in turn Reducing the current range down to just that sub-range.

The decoder must have the same probability estimation the encoder used.

When all symbols have been encoded, merely identifying the sub-range is

enough to communicate the entire .

A single integer used to identify the sub-range.

If there is a sequence of digits every integer beginning with that prefix

falls in a sub-range.
Then the prefix used to identify the sub-range & thus transmit the

message.

2.Encryption
Mobile devices -limited computation capability. Appropriate security mechanisms needed.

Key services-Confidentiality, integrity, availability.

SMS has several problems-unsecure. SMS-plain text-anyone can have access to SMSC can read SMS. Thus to provide security-encryption is used-make the text

unreadable.
Here we use- Data Encryption Standard(DES) for encryption.
To implement DES we make use of Bouncy castle package.

Data Encryption Standard

Block cipher Symmetric algorithm-same key used for encryption and

decryption.
Operates on 64 bits plain text block Key used is 56 bits and produce cipher text of 64bits. Reverse process is used in decryption using same 56bits key. DES -several substitution and permutation primitives, to

encrypt a data block.

Each set primitive operations-rounds-des-16 rounds.

Input: T: 64 bits of clear text k1, k2, ..., k16: 16 round keys IP: Initial permutation f(): Round function Output: C: 64 bits of cipher text Left sideThree phases: 1.Initial permutation T=IP(T) 2.16 roundspermutation and substitution. 3.O/p of 16th roundswappedpreoutput C=IP-1(preoutput)

Right side:
1.

64bit keypermuted choice1ignores every 8th bitgenerates 56bit key. Subkeys for 16roundsleft circular shift and permutation.

2.

Algorithm: T' = IP(T), applying initial permutation (L0, R0) = T', dividing T' into two 32-bit parts (L1, R1) = (R0, L0 ^ f(R0, k1)) (L2, R2) = (R1, L1 ^ f(R1, k2)) ...... C' = (R16, L16), swapping the two parts C = IP-1(C'), applying Inverse initial permutation.(^=XOR operation)

 Single Round of DES

The round function f(R, k) is defined as:

Input:
R: 32-bit input data k: 48-bit round key E: Expansion permutation P: Round permutation s(): S boxes function

Output: R' = f(R,k): 32-bit output data

Algorithm:

X = E(R), applying expansion permutation and returning 48-bit data

X' = X ^ k, XOR with the round key X" = s(X'), applying S boxes function and returning 32-bit data R' = P(X"), applying the round permutation

The S boxes function s(X) is defined as:

Input:
X: 48-bit input data S1, S2, ..., S8: 8 S boxes (4 x 16 tables) Output: X' = s(X): 32-bit output data Algorithm: (X1, X2, ..., X8) = X, dividing X into 8, 6-bit parts X' = (S1(X1), S2(X2), ..., S8(X8)) Eg:011001first & last bitrowrow1 middle 4bitscolumn col 12 Substitutesvaluerow1 & col 12 90101

Screenshots

Analysis
ComEn is designed for the secure sending and receiving of messages:
The security is ensured by compression followed by

encryption.
Compression is achieved by applying two methods :
Human Interpretative Compression Range Encoding Compression methods.

A performance analysis is also done by comparing the two

methods of compression.

 Same texts were given as input for the analysis. Then the text is compressed using both the algorithms, dictionary

method and range encoding.

Analysis report is generated contains-Compressed texts length,

time taken and the compressed data.

By giving different inputs- generalization is made For sentences of comparatively shorter length, dictionary method is

considered better.
Efficiency of dictionary method depends on the words in library. For sentences of very long length , Range Encoding Compression

method is considered better.

 The results of our proposed technique are based on Symbian

OS and tested using in Nokia E series phone.

SMS Compression given data to reduce its length.
Then encrypting - encryption algorithm to guarantee its

security.
Different lengths of data are given as input for analysis The original length and compressed lengths are used to find

the ratio of compression.

It can be graphically represented as follows:

Conclusion
ComEn is a J2Me application

It is designed for the secure sending and receiving of messages.

Ensures an end-to-end security in SMS communication. The Compression is done by Dictionary method and can use range

encoding .
Encryption is done by DES algorithm.

From the user perspective, it ensures cost effectiveness with

security.
Confidentiality and authentication of messages even message

exceeds 160 characters is ensured.

Future Scope
So far, our compression and encryption that is developed can be used with Nokia S60 and s40 series.
Future work is required to apply the proposed technique to mobile

phones and low end series phones.

Limitation of dictionary method can be eliminated to a certain extent by

extending the library .

It is better to use lossless compression algorithms to compress the SMS.

Overhead of using shared key cryptography can be eliminated by using

public key cryptographic methods.

References:
[1] Gobi.R, Sathya.P, Dr.E.George Dharma Prakash Raj, Sasikumar.T, ComEn- A Mobile

Device Compression and Encryption Approach, Proceedings of the International Conference on Communication and Computational Intelligence 2010.
[2] Tarek M Mahmoud, Bahgat A.Abdel-latef, Awny A.Ahmed and Ahmed M Mahfouz,

Hybrid Compression Encryption Technique for Securing SMS, International Journal of Computer Science and Security (IJCSS).
[3] P. G. V. Suresh Kumar, Nasreddin B. El. Zoghbi and Nand Kumar, "Data Compression

Technique in Mobile Phones", Proceedings of the 5th National Conference; INDIACom2011.

[4] J. Orlin Grabbe ,DES algorithm illustrated. [5] Senthil Shanmugasundaram and Robert Lourdusamy, "A Comparative Study Of Text

Compression Algorithms", International Journal of Wisdom Based Computing, Vol. 1 (3), December 2011
[6] DES algorithm,www.wikipedia.com.