Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
3Activity
0 of .
Results for:
No results containing your search query
P. 1
A New Secure Approach for Message Transmission by Godelization and FCE

A New Secure Approach for Message Transmission by Godelization and FCE

Ratings: (0)|Views: 198 |Likes:
Published by ijcsis
In this paper, we devised a novel algorithmic approach for transmitting information through Fast Comparison Encryption (FCE) algorithm. The proposed scheme uses an algorithm name it as FCE which transforms the information into an encoded Godel Number Sequence (GNS) which results in a text. It will be reconstructed at the other end using the inverse process.
In this paper, we devised a novel algorithmic approach for transmitting information through Fast Comparison Encryption (FCE) algorithm. The proposed scheme uses an algorithm name it as FCE which transforms the information into an encoded Godel Number Sequence (GNS) which results in a text. It will be reconstructed at the other end using the inverse process.

More info:

Published by: ijcsis on Mar 08, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/19/2011

pdf

text

original

 
A New Secure Approach for MessageTransmission by Godelization and FCE
Dr. Ch. Rupa P. S. Avadhani Dr.D. Lalitha Bhaskari
Associate Professor, Professor, Associate Professor,Dept of CSE, Dept of CS&SE, Dept of CS&SE,VVIT, Andhra University, Andhra University,Guntur (dt). Vizag. Vizag.
chrupaphd@gmail.com psavadhani@yahoo.com lalithabhaskari@yahoo.co.in
Abstract
In this paper, we devised a novel algorithmicapproach for transmitting information through FastComparison Encryption (FCE) algorithm. The proposedscheme uses an algorithm name it as FCE whichtransforms the information into an encoded GodelNumber Sequence (GNS) which results in a text. It willbe reconstructed at the other end using the inverseprocess.
Key Words: GNS, FCE.
I. INTRODUCTIONIn simple terms, authentication isidentification plus verification.
Identification
is theprocess whereby an entity identity, rather than one-wayauthentication, whereby only one principal verifies theidentity of the other principal, is usually required.There are three main types of authentication in acomputing system [4]:a. Message content authentication -verifying that thecontent of a received message is the same as when itwas sent; in a computing environment.b. Message origin authentication - verifying that thesender of a received message is the same one recordedin the sender field of a message; andc. General identity authentication - verifying that aprincipal’s identity is as claimed.Lack of security may exist when a volume of data is transferred from its source to the destination if no measure is taken for its security. For one reason or the other, most of the data being transmitted must bekept secret from others [5]. A very important reason toencode data or messages is to keep them security. Inthis paper, a
 
novel method for message authenticationis proposed. This is an efficient encryption scheme byusing Godel number sequence (GNS) [1] and Fastcomparison encryption scheme (FCE) [2], FCE usesany block cipher to encrypt only a few bytes of randomseeds in each page of the database, and uses lighter-weight computation to encrypt the actual data in ainformation. The low
 
overhead of FCE enables efficient comparison and,therefore, efficient indexing on the ciphertext. In thiswork, we specifically aim at encryption to ensure thesecurity of on-disk data. FCE is specifically tailored todatabase systems in the following way, Comparison isfast, which facilitates the search of indices.II. GODEL NUMBER SEQUENCEA mathematical concept termed as Godelization[1] is used as an encoding scheme. The scheme of Godelization is explained as follows: Primefactorization theorem states that every positive integer greater than one can be factored into multiplication of primes, and this factorization is unique except for difference in the order of the factors. To factor anumber ‘n’ is to write it as a product of other primenumbers:n=a x b x cFactoring a number is relatively hard compared tomultiplying the factors together to generate thenumber.For any number ‘n’ of natural numbers, theGodel number sequence (GNS) is given by :GNS (n) = (x0, x1, x2,…xk) wheren = (2
x0
)*(3
x1
)*(5
x2
)…((PrNo(k))
xk 
) where PrNo(k) isthe k 
th
prime.90
 
= (2
1
)*(3
2
)*(5
1
)GNS (90) = (1, 2, 1)The Godel number sequence [1] will beencoded by using Fast comparison Encryption for improving the security of the information and reducethe complexity of the computation. Fast comparisonencryption scheme is very light weight mechanism.This will be described in the following section.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011195 http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
A. Inverse Gödelization
At the receiver side, there is a need to performthe inverse operations of Gödelization technique toobtain the original data. It is the process of decompressing the string by replacing alphabets withdigits and any substring KX is decompressed with K occurrences of X. The string obtained is in the form of GNS(i
1
)$GNS(i
2
)$......$GNS(i
n
) which is the GödelString of the image and inverse Gödelization is appliedto the string to obtain the intensity values of the imagewhich are calculated as GNS(i) = (x
0,
x
1,……
x
) where i=2
x0 
* 3
x1 
* 5
x3
…. P
xk  
.III. FAST COMPARISION ENCRYPTIONEncrypt a plaintext by using FCE [2]. Let’sconsider size of GNS of the original information is ‘P’bytes. Convert it into bits while computing. Let’sdenote the key by ‘K’(1byte). It should be generaterandomly from the input by using random permutationfunction (Perfun). |K| gives length of the Key.
A. Key Generation:
Perfun :It is a random permutation function
 
{1,2,...P }
{1,2,...P }Step 1: Let s
i
is a starting bit of a key.For j=1 to Ps
j
= Perfun(j) mod |K| . It is in the range of [0, |K|-1].Step 2: Sj is the starting bit of the Key ‘K’.
B. Encryption Algorithm
Input: Plain Text (P bytes), randomly generated key K (symmetric), and random permutation function.Output: Cipher text (En)AlgorithmStep 1 : Generate GNSStep 2
:
Find s
j .
 Step 2 : Find K.Step 3: En
En
i
= K P
i.
Consider and generate the Godel number sequence (GNS) [1] to each byte of the plain textseparately. Encrypt the GNS of the each byte by usingfast comparison encryption scheme (FCE) [2] and sendto the receiver. The cipher text byte (E
n
) of theplaintext byte P
i
is simply the bitwise XOR of K. Thisprocess is shown in the figure 1.
iguare 1. Encryption Algorithm
 
C. Decryption Algorithm
Input : Ciphertext (En
i
), K.Ouput : PlainText
Algorithm
Step 1: Decrypt the data.P
P
i
=K En
i
Step 2: Apply reverse Godelization on ‘P’.Consider and decrypt each byte of theEncrypted text by using FCE and get the original textby applying the reverse godelization. This is shown inthe figure 2.
Fig 1.
figure 2. Decryption Algorithm
IV. Proposed MethodologyThe main contribution of this paper is towardsdevelopment of new algorithms which increase the datapayload capacity than the regular methods and followsa layered approach for encoding and authenticity for more robustness. A technique termed as Godelizationmethod [1] combined with FCE method [2, 3] is usedas embedding technique. The proposed methodology isbased on mathematical concept known as Gödelizationwhich is used as one of the encoding schemes. Later another improved technique based on a newcompression technique known as Fast ComparisonEncryption technique. The implementation results of the proposed method are shown in Figure 3 and Figure4.
 Encryptby FCEOutputInputGenerateGNS
 ReverseGodelizationOutput(Decryp)
 
Input(Encrypt)Decryptby FCE
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011196 http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
V. Results
figure 3. Encryption by FCE with GNSfigure 4. Decryption by FCE with reverse GNS
REFERECES1. D.Lalitha Bhaskari, P.S.Avadhani, A. Damodaram,
“A combinatorial Approach for Information HidingUsing Steganography And Godelization Techniques”,
 Journal of IJSCI(International Journal of Systemics,Cybernatics and Informatics, pp 21-24, ISSN 0973-4864, 2007.2. S. Goldwasser and S. Micali. “ProbabilisticEncryption of DES and FCE”, In. J of Computer andSystem Sciences, Vol. 28, pp. 270-299. 19843. Ch.Rupa et. al,
“Fast Comparison EncryptionScheme using cheating text Technique”,
InternationalJournal of Engineering Science and Technology, Vol.2(6), pp. 1725-1728, 20104. Thomas Y.C. Woo and Simon S. Lam,
“Authentication for distributed systems”,
IEEEtransactions, pp. 39- 53, 19925. W. Stallings,
“Cryptography and Network Security”
, Principles and Practices, Pearson Education,2004.6. Tingjian Ge, Stan Zdonik,
“Fast, SecureEncryption for indexing in a Column -Oriented DBMS”, I 
CDE 2007, pp: 676-685, 2007.7. M. Bellare, A. Desai, E. Jokipii, P. Rogaway,
“Aconcrete security treatment of symmetric encryption”,
 In Proceedings ofthe 38
th
Symposium on Foundationsof Computer Science, IEEE, 1997.8. Goldreich, “Foundations of crypto- graphy”,Cambridge University Press, 2003.9. D.Lalitha Bhaskari, P.S.Avadhani, A. Damodaram,
”A New Image Hiding Technique Based On MultipleImage Retrieval And Public key Encryption Method “,
 Proc. of International Conference on Sensors,Security, Software and Intelligent Systems,ISSSIS-09,Coimbattore, 2009.10. D.Lalitha Bhaskari, P. S. Avadhani, A.Damodaram,
”A Blind Audio Watermarking Scheme
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011197 http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->