(IJCNS) International Journal of Computer and Network Security, 55

Vol. 2, No. 4, April 2010

Design of a Novel Cryptographic Algorithm using

Genetic Functions
Praneeth Kumar G1 and Vishnu Murthy G2
1
C V S R College Of Engineering,
Ghatkesar, Andhra Pradesh, India
praneethkumar@hotmail.com
2
C V S R College Of Engineering,
Ghatkesar, Andhra Pradesh, India
gvm189@gmaill.com

that both have remainder of 3 when divided by 4. That is,

Abstract: Information Security plays a key role in the field of
modern computing. Here, at this paper we present a new
cryptographic algorithm which is proven to be resistant to
Cryptanalysis, Bruteforce and timing attacks. As the algorithm
uses Blum Blum Shub Genrator, A Cryptographically Secure
Pseudorandom Bit Generator (CSPRBG) for deriving the key
and Gentic Funtions in the process of Encryption. A comparison
of the proposed technique with existing and industrially
accepted RSA and Triple-DES has also been done in terms of
resistance to attacks and the various features of the algorithm.
Keywords: Encryption, Decryption, Blum, Blum, Shub
Generator, Genetic Functions.
1. Introduction
Information Security plays a vital aspect of modern
computing systems. With the global acceptance of the
Internet, virtually every computer is connected to every
other. So at this point of time maintaining secrecy and
security of information has become necessity. For these
reasons different types of research works on encryption and
decyption is going on so that various algorithms are
developed in this field. The process of encoding a message
so that it can be read only by the sender and the intended
recipient is known as encryption. The encoded version is
known as cipher text and process of decoding the cipher text
is known as Decryption.
The Algorithm uses Blum Blum Shub Generator for
generating key and Genetic functions “CROSSOVER” and
“MUTATION” in the process of encryption and decryption.
The Algorithm uses a key of four parameters, for security
which makes it resistant against Bruteforce attack.
Key = {p, q, s, k}
Where, p, q are two large prime numbers and s is a
randomly chosen number where s is relatively prime to n
(product of p and q) and k is Key Size used.
p≡q≡3 (mod 4)
means that (p mod 4)= (q mod 4)= 3. Let n = p X q. Next,
choose a random number s, such that s is relatively prime to
n; this is equivalent to saying that neither p nor q is factor of
s. Then the BBS generator produces a sequence of numbers
Xi according to the following algorithm:
X0 = s2 mod n.
for i =1 to infinite
Xi = (Xi-1)2 mod n
The BBS is referred to as a cryptographically secure
pseudorandom bit generator (CSPRBG). A CSPRBG is
defined as one that passes the next- bit test , Which is
defined as follows: “A Pseudo random bit generator is said
to pass the next-bit test if there is not a polynomial-time
algorithm that, an on input of the first k bits of an output
sequence, can predict the (k+1)st bit with probability
significantly greater than 1/2”. The security of BBS is based
on the difficulty of factoring n. That is, we need to
determine its two prime factors p and q.
2.2 Genetic Functions
In the proposed algorithm we use two genetic functions
“CROSSOVER” and “MUTATION”.
Crossover is a genetic function which can be described by
the following figure: As Illustrated in the figure the Binary
representation of key and plain text are Crossected. We have
two forms of crossover: Single and Double Crossover.
Taking 1 breaking point for a single crossover and 2
breaking points for double crossover.
Crossover :

2. Literature Survey

2.1 Blum, Blum, Shub Generator

A popular approach for generating secure pseudorandom
number is known as the Blum, Blum, Shub (BBS)
generator, named for its developers[1]. The procedure is as Mutation is a genetic function where the bit at a given
follows. First, choose two large prime numbers, p and q , position is inversed (i.e., 0 to 1 and vice versa).
56 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 4, April 2010

3. Proposed Algorithm AB AD A’ D
è(Crossover) è(Mutation)
The algorithm consists of two phases where the first phase
CD CB C’ B
is of generating random numbers and the other performs
encryption/ decryption.
Double Crossover
3.4 Key Generation Suppose that the Message is AB and Key is CD
The algorithm uses a 4-tuple key {p, q, s, k} where p and
q are large prime numbers, s is a chosen random number Where, A is part of Plain text before first breaking point
which is relatively prime to n, the product of p and q and k, B is part of Plain text between first and second
the key size. The key size is of Variable one. breaking points.
Then, the algorithm uses the Blum, Blum, Shub C is part of Plain text after the second breaking
Generator for generating the random numbers (Which is point.
described in Section 2.1) which are used as keys in each D is part of Key before first breaking point.
iteration for encryption. E is part of Key between first and second breaking
1. Choose p=7 and q=19
point.
2. Implies, n= 7 X 19 = 133
F is part of Key after the second breaking point.
3. Choose s=100, relatively prime with 133
4. Then, X0=s2mod n= (100)2 mod 133= 25
X1=(X0)2 mod n= (25)2 mod 133= 93 ABC DBF D B’ F
X2=(X1)2 mod n= (93)2 mod 133= 4 è(Double Crossover) è(Mutation)
X3=(X2)2 mod n= (4)2 mod 133= 16 DEF AEC A E’ C
. .
. . Then, the Plain Text’s (Binary representation of ASCII
Here, the key is represented as {7, 19, 100, 8 }. code) is cross-over’d with Key (Binary representation)
generated by BBS (Section 3.1)
3.5 Encryption/ Decryption Algorithm
The proposed algorithm follows the below given method Here, The Cipher text that will be sent consists of 2 numbers
for encryption and decryption. The Random numbers should A’D and C’B instead of AB in the reverse number (if single
be generated concurrently in both the processes. crossover is performed) and DB’F and AE’C instead of
3.2.4 Encryption ABC in the reverse order (if double crossover is performed).
The Encryption process is carried out as :
for every bit in the file until EOF For the plain text “TEXT” the encryption process is as
if random number generated is odd follows:
perform CROSSOVER between plain text(binary
representation of ASCII value) and the random Character ASCII Value Binary Value
number(in binary representations ) where the T 83 01010011
breaking point is xi%k . E 69 01000101
else if the number generated is even X 87 01010111
perform Double CROSSOVER between plain T 83 01010011
text(binary representation of ASCII value) and the
random number(in binary represenations) where the 01010011(83) 01011001 01001001(73)
first breaking point is xi%k and second one is è(Crossover) è(Mutation)
(xi+s)%k. 00011001(25) 00010011 00000011(3)
perform MUTATION at the (2*xi)%k position in the
offsprings.. So the Cipher Text is (3, 73). This process is continued until
all the text in source file (Plain text) is completed.
The set of two numbers from the above output is the cipher 3.2.5 Decryption
text.
Single Crossover The Decryption process is carried out as :
Generate random numbers concurrently.
Suppose that the Message is AB and Key is CD for every bit in the file(cipher text) until EOF
Where, A is part of Plain text before breaking point if random number generated is odd
B is part of Plain text after breaking point. read two characters at a time.
C is part of Key before breaking point. perform CROSSOVER between the second number
D is part of Key after breaking point. read and the xi(binary representations) where the
breaking point is n%k .
perform MUTATION at the (2*xi)%k position in the
crossovered numbers.
 (IJCNS) International Journal of Computer and Network Security, 57
Vol. 2, No. 4, April 2010

perform CROSSOVER between first offspring of the Ease of analysis : The algorithm is explained concisely over
above phase and the first character read(in binary here. Even though it is difficult to cryptanalyze . RSA and
representations). DES lacks in this feature.
else if the number generated is even
perform Double CROSSOVER between the second 5. Conclusion and Future Enhancements
number and the key (binary representation of ASCII
Hence, The paper proposes a new algorithm which is
value)where the first breaking point is xi%k and
equivalently secure with RSA and Triple DES and which
second one is (xi+s)%k .
can be easily implemented on the hardware.
perform MUTATION at the (2*xi)%k position in the
crossovered numbers. Future process will be devoted to extend the algorithm to
perform CROSSOVER between first number of the achieve the other security services like Authentication, Data
above output and the first character read(binary Integrity etc.,
representations).
References
The first number of the above output is the plain text(if
single crossover is to be performed) [1] Lenore Blum, Manuel Blum, and Michael Shub.,
“Comparision of two pseudo random number
generators” Proc. CRYPTO’82, pages. 61-78,
A’ D A’ D A D
Newyork, 1983.
è(Crossover) è(Mutation)
[2] William Stallings, “Cryptography and Network
C D C’ D C’ D
Security”, Prentice Hall, 3rd Edition.
[3] Subramil Som, Jyotsna Kumar Mandal and Soumya
A D A B à Plain Text Basu, “A Genetic Functions Based Cryptosystem
è(Crossover) (GFC)”, IJCSNS, September 2009.
C’ B C’ D [4] Ankit Fadia, “Network Security”, Macmillan India Ltd.

If double crossover is to be performed

Authors Profile
D B’ F D B’ F DBF
è(Double Crossover) è(Mutation) Praneeth Kumar G received the B.Tech
DE F DEF DEF Degree in Computer Science and
Engineering from Progressive Engineering
College in 2008. During May’ 2008 –
DB F ABC à Plain Text
Aug’ 2009, he worked in Concepts in
è(Double Crossover) Computing(CIC) as a Software Engineer.
A E’ C D E’ F He is presently working at C V S R
College of Engineering as an Assistant
4. Analysis Professor. His areas of interest include
software engineering and Information
The proposed algorithm has the following advantages : Security.
Suitable for hardware or software: Algorithm uses only
primitive computational operations that can be easily Vishnu Murthy G received the B.Tech.
and M.Tech. degrees in Computer Science
implemented on hardware in a less economic way. Which is
and Engineering. He is resource person for
not possible with RSA and Triple DES. IEG and Birla Off campus programmes.
Variable-length key : The key length can be varied in the He is presently pursuing his Ph.D in
algorithm which is possible in RSA but not in Triple DES. J.N.T.U. and heading the Department of
Low memory Requirement : A low memory requirement Computer Science and Engineering in C V
S R College Of Engineering. His areas of
makes the proposed algorithm suitable for smart cards and
interest include software Engineering,
other devices with restricted memory which is not possible Information Security and Image
in RSA and Triple-DES. Processing.
Resistant to Known Plain Text, Known Cipher Text and
Bruteforce Attacks
Resistant to Timing Attack : As the algorithm uses Blum,
Blum, Shub generator for Key Generation it is resistant to
timing attacks(Section 2.1). RSA is prone to this kind of
attack but Triple-DES is not.
Computationally Secure : As the proposed algorithm maps
each character in plain text to two characters in cipher text.
It is hard to break the cipher. This feature is present in both
the RSA and Triple-DES algorithms.