On the Information Security Using Fibonacci Series
Balasaheb S Tarle,
Assistant Professor in Computer Engg., MVPS’s KABGT College of Engg., Nashik-13.
tarle_bs@yahoo.co.in
Abstract
Now a day information security becomes a
wider, complex and more important problem.
Encryption can be an important tool to help in
improving day information security. Information
encryption mainly is the scrambling of the content of
data, such as text, image, audio, video and so forth to
make the data invisible during transmission. In this
paper work, I developed techniques for securing
information to avoid hacking as well as providing the
user with some additional features such as key for
integrity and validation of user. In this technique one
can secure any type of files using Fibonacci series.
The proposed encrypt/decrypt algorithm is loss-less,
key-dependent. The performance of the popular
symmetric key algorithms including DES, 3DES, AES
,Blow fish these algorithms compared with Fibonacci 1.2
Series encryption by encrypting input files of varying
contents and sizes. The present Fibonacci
encryption/decryption algorithm is implemented in C
sharp language, and tested on two different Intel
processors, to compare its performance. At present
Fibonacci Series Algorithm is used for securing input
files of varying contents and sizes using graphical
password as key. The results reveal that Fibonacci
encryption is the fastest among symmetric
algorithms.
Keywords
Encryption, decryption, keys, Message matrix,
cryptography
1. Introduction
1.1 Overview
Data security is a much wider term than hardware or
a software feature. In the entire environment of
security, it is necessary to really insure privacy.
Everyone in the group must be aware of the security
goals and be conscientious
in achieving them. Usually security is lost due to slip
of security guard. It must be even maintained during
the disposal of printouts of previously encrypted data.
As data communication is becoming more pervasive,
complex and the use of digital data is becoming much
more widespread, data security has become a wider,
complex and more important problem. Encryption
can be an important tool to help in improving data
security.
The critical concern in designing an encryption
algorithm is the security of the algorithm against
undesirable attacks. In my project, the performance
of the leading secret key algorithms has been
compared on different platforms, using input data
files of varying sizes and formats. While comparing
the performance of algorithms, the time required to
set up the key(s) has been ignored.
Scope
The requirements of data security of any application
focus on three major questions:
1: What are user’s needs and how does Data security
system meets them?
2: What resources are available for a given security
system? Is Problem worth solving?
3: What is the likely impact of the security system on
the organization? How can the
Problem is redefined?
Data security algorithm can be used to avoid hacking
of confidential data. Without knowledge of this
software a third person cannot access data. The key
used for algorithms should be known to the user. This
algorithm is most useful in e-commerce, banking, and
online transaction processing applications, small or
large-scale industry, medical imaging, telemedicine,
and military communication and Banking etc.
1.3 Fibonacci Series
The Fibonacci series is the emerging area in the data
security. The theory of Fibonacci numbers and
Fibonacci series has wide use in theoretical physics
in resent decades. The new class of square Fibonacci
(p+1) (p+1) matrixes are based on Fibonacci p-
numbers (p=0, 1, 2, 3 ...). It has been proved that the
determinant of any Fibonacci matrix or its power is
equal to ±1. An original Fibonacci coding/decoding
method follows from the Fibonacci matrices.
1
 The general idea of the Fibonacci Series
Encryption/Decryption Algorithm is similar to the
Fibonacci coding and based on the application of the
generalized Fibonacci matrices, the Qp-matrices, for
encryption and decryption of the initial message.
1.4 Performance Measurement and
Comparisons
The performance of the popular secret key algorithms
including DES, 3DES, AES, Blowfish, [3] is
compared by encrypting input files of varying
contents and sizes. The present Fibonacci
encryption/decryption algorithm is implemented in C
sharp language, and tested on two different Intel
processors, to compare its performance. At present
Fibonacci Series Algorithm is used for securing input
files of varying contents and sizes. In the end, I
conclude that Fibonacci encryption is the fastest
among symmetric algorithms. Another advantage of
this algorithm is the use of graphical password to
generate numerical key.
1.5 Paper Organization
The rest of this paper is organized as follows: section
2 gives a brief introduction of some of existing
algorithms used encryption/decryption along with
required explanation of Fibonacci series; section 3
provides Fibonacci Series encryption/decryption
algorithm that have been chosen for implementation;
section 4 provides implementation details,
performance measurement and comparison results
and finally section 5 concludes the work.
2 Introduction
During this time when the Internet provides essential
communication between millions of people and is
being increasingly used as a tool for commerce,
security becomes an important issue to deal with.
There are many aspects to security and many
applications, ranging from secure commerce and
payments to private communications and protecting
passwords.
2.1 Symmetric-key algorithms
Symmetric key algorithms are a class of algorithms
for cryptography that use trivially related
cryptographic keys for both decryption and
encryption.The encryption key is trivially related to
the decryption key, in that they may be identical or
there is a simple transform to go between the two
keys. The keys, in practice, represent a shared secret
2
between two or more parties that can be used to
maintain a private information link.Other terms for
symmetric-key encryption are single-key and private-
key encryption..
2.2 Generalized Fibonacci numbers
In mathematics, the Fibonacci numbers form a
sequence defined recursively by:
That is, after two starting values, each number is the
sum of the two preceding numbers. The first
Fibonacci numbers, also denoted as Fn, for n = 0, 1,
… , are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,
233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946,
17711, 28657.
Sometimes a definition is seen, starting the sequence
at F1 = 1, but it is more common to include F0 = 0. It
is called generalized Fibonacci numbers.[10] For the
given non-negative integer p (p = 0, 1, 2, 3 ...) the
generalized Fibonacci numbers called the p-
Fibonacci numbers are given with the following
recurrent formula:
Fp(n)=Fp(n-1)+Fp(n-p-1) with n>p+1; (2.1)
Fp(1) = Fp(2) = ... = Fp(p) = Fp(p+1) = 1 (2.2)
The recurrent formula (2.1) at the initial conditions
(2.2) generates the infinite number of the numerical
series, which numbers are called the p-Fibonacci
numbers [10] Form recurrent relation eq.(2.1) and the
initial condition eq.(2.2) for calculation of the p-
Fibonacci numbers Fp(0), Fp(-1), Fp(-2), ..., Fp(-p), ...,
Fp(-2p + 1). Representing the p-Fibonacci number of
Fp (p + 1) in the form of eq. (2,1) we get:
Fp (p+1) = Fp (p) + Fp (0). (2.3)
Since according to eq. (2.2) Fp(p) = Fp(p + 1) = 1 it
follows from eq. (2.3) that Fp(0) = 0. Continuing this
process, which is, representing the p-Fibonacci
numbers Fp (p), Fp (p - 1),...,Fp(2) in the form eq.(2.1)
we get:
Fp(0) = Fp(-1) = Fp(-2) = ... = Fp(-p + 1) = 0. (2.4)
Let's represent the number Fp (1) in the form:
Fp (1) = Fp (0) + Fp (-p). (2.5)
Since Fp(1) = 1 and Fp(0) = 0 it follows from eq.(2.5)
that Fp(-p) = 1. (2. 6)
Representing the p-Fibonacci numbers Fp (0), Fp (-
1)... Fp (-p + 1) in the form eq. (2.1) we can find that
Fp(-p - 1) = Fp(-p - 2) = .. = Fp(-2p +1) = 0.(2. 7)
Continuing this process we can get all values of the
p-Fibonacci numbers Fp(n) for the negative values of
n[10] and now we have all reasons to introduce one
more complicated concept, the concept of the
generalized Fibonacci matrix called Qp-matrix.
2.3 Fibonacci Q-Matrix Fn 13 8 5 3 2 1 1 0
n -1 -2 -3 -4 -5 -6 -7
Fibonacci series was supplemented by the theory of Fn+1 0 1 -1 2 -3 5 -8
so-called Fibonacci Q-matrix. The latter presents Fn 1 -1 2 -3 5 -8 -13
itself the simplest 2 x 2 matrix of the following form: If we select number n = 1 in the first row of Table 2.4
and then four Fibonacci numbers in two lower rows
1 1 
Q=  (2.8) we can see that a totality of the four Fibonacci
1 0  numbers forms the Q-matrix. Moving along Table 2.4
The determinant of the Q-matrix is equal -1. to the left about Q-matrix we will get consecutively
But what relation has the Q-matrix to Fibonacci the matrices Q2, Q3, ..., Qn. Moving to the right
numbers? about Q-matrix we will get consecutively the
To answer this question it is necessary to take the n- matrices Q0, Q -1, ..., Q -n. As example we can see in
th power of the Q-matrix.[11] Then we will get: Table 2.4 the matrix Q 5 and the inverse matrix Q -5.
F Fn 
Q n =  n +1  (2.9)
 Fn Fn−1  2.4 Fibonacci Matrices
Where Fn-1, Fn, Fn+1 are the Fibonacci numbers.
But we know that Det (An) = (Det A)n. It follows from One can use the idea of the Fibonacci Q-matrix for
this the following property for the determinant of the obtaining the general Q-matrix for the p-Fibonacci
Q-matrix: numbers [10]. Let's introduce now the following
Det Qn = (-1)n (2.10) definition for the Qp-matrix:
Where n is an integer.
But if we calculate Det Qn using eq.(2.9) and use eq.
(2.10) then we get the following identity connecting
three neighboring Fibonacci numbers:
D et Q n = Fn −1 + Fn+1 − Fn2 = (− 1 )
n
(2.11) (2.17)
Thus, this means that the Q-matrix express one of the Where the index of p takes the following values: 0, 1,
most important properties of Fibonacci numbers 2, 3,.....Note that the Qp-matrix is the square (p + 1)
given with eq.(2.11) (p + 1)-matrix. It contains the p × p unit matrix
Let's represent now the matrix eq.(2.9) in the bordered by the last row of 0's and the first column,
following form: which consists of 0's bordered by 1's. For p = 0, 1, 2,
 F + Fn −1 Fn −1 + Fn − 2   Fn Fn −1   Fn −1 Fn − 2 
Qn =  n  = F +F (2.12) 3, 4 the Qp-matrices have the following forms,
 Fn −1 + Fn − 2 Fn − 2 + Fn −3   n −1 Fn − 2   n−2 Fn −3 
n n-1 n-2 respectively:
or Q = Q + Q . (2.13) 1 1 0 0 0
1 1 0 0 0 0
Let's write the expression (2.13) in the following 1 1 0     1 0 0 
0 0 1 0
Q0 = ( 1)  
=
1 1 
form: Q1 =  
1 0 
= Q Q2 = 0 0 1 Q3
  0 0 0 1
Q4 =  0 0 0 1 0
1 0 0   
Qn-2 = Qn - Qn-1. (2.14)   
1 0 0

0 0 0 0 0 1
1 0 0 0 0 
The inverse matrix Q -n has the following form: 

F − Fn  Let's compare the neighboring matrices Q4 and Q3. It

Q − n =  n −1  (2.15) is easy to see that the matrix Q4 is reduced to the
 − Fn Fn+1 
matrix of Q3 if we cross out in the matrix Q4 the last
Inverse matrix Q -n from the direct matrix Qn it is (5th) column and the next to the last (4s) row. Note
necessary to rearrange in eq. (2.2) the diagonal that we have 1 on the crossing out of the 5th column
entries Fn+1 and Fn-1 and to take them with the and 4s row. Because the sum 5 + 4 is equal to the odd
−n n −1  −F F  number of 9 it means that determinant of the matrix
opposite sign that is: Q =  F − F 
n
(2.16)
 n n+1  of Q3 differs from the determinant of the matrix of Q3
Other method to get the matrix Qn follows directly only by the sign, that is,
from the expression of (2.9). For that it is necessary Det Q4 = - Det Q3. (2.18)
to present two sequences of Fibonacci numbers You should believe that the result eq.(2.18) is valid
shifted one to another in one column (Table 2.4). and that the latter follows from the matrix theory. By
analogy it is easy to prove the following correlations
for determinants of the neighboring Fibonacci Qp-
Table 2.4 Fibonacci numbers shifted one to another in matrices:
one column Det Q3 = - Det Q2; Det Q2 = - Det Q1.
Taking in consideration that Det Q0 = 1 and Det Q1 =
n 7 6 5 4 3 2 1 0 -1 we get the following unique mathematical property
Fn+1 21 13 8 5 3 2 1 1 of the Qp-matrices in the general case.

3
 Det Qp = (-1)p (2.19)
Thus the determinant of each matrix eq.(2.17)
depends on the value of the index p. If the index p is
even then the Det Qp = 1 for all matrices of the kind
eq.(2.17). In the opposite case (p is the odd number)
Det Qp = 1.
Let's consider now the matrix being the n-
th power of the Qp-matrix.
(2.20)
Thus, the matrix Q
n 1, 2, 3, …. Let us choose the Fibonacci Qp-matrix Q p
p is expressed through p-Fibonacci
numbers resulting from Pascal Triangle, and the
result eq.(2.20) is the new secret of the Pascal
Triangle[11]. And now we will try to calculate the
determinant of the matrix eq.(2.20). it follows from
the matrix theory that
DetQpn = ( DetQ p ) n (2.21)
Using eq.(2.19) we can write the expression (2.21) in
the form:
DetQ p = ( −1)
np
(2.22)
Where p = 0, 1, 2, 3... n = 0, ±1, ±2, ±3...
And now I can express regarding the result of eq.
(2.22) and regarding the power of the mathematical
theories. It is really impossible to image that the p-
Fibonacci numbers resulting from Pascal Triangle
and this can become the basis of the new and infinite
class of the square matrices expressed by eq. (2.17)
and (2.20). The result of eq.(2.22) seems to us
absolutely incredible. It is impossible to imagine that
the determinant of the matrix eq. (2.20) is always
equal to 1 or to (-1) that follows from eq.(2.22).
It is clear that the expressions (2.20) and (2.22) give
unlimited opportunities for the "Fibonacci
investigations" because they allow obtaining the
infinite number of the fundamental correlations
connecting the p-Fibonacci numbers Fp(n). For
example for the 2-Fibonacci numbers (p = 2) we have
the following correlation connecting the neighboring
2-Fibonacci numbers:
Det = F2(n + 1)[F2(n - 2)F2(n - 2) - F2(n - 1)F2(n -
3)] +F2(n)[F2(n)F2(n - 3) - F2(n - 1)F2(n - 2)] + F2(n -
1)[F2(n - 1)F2(n - 1) - F2(n)F2(n-2)] = 1.
n Encryption/decryption matrix.
We cannot predict now the role of the Qp -matrices
given with (2.20) and their applications in different
branches of mathematics, physics and other sciences.
However I believe that this result can become
fundamental as Pascal Triangle generating p-
n
Fibonacci numbers and Qp -matrices eq. (2.20).
4
3 Fibonacci Series Encryption /
Decryption Algorithms
3.1. Introduction
The Fibonacci series is an emerging area in data
security. The general idea of the Fibonacci series
encryption/decryption is based on the application of
the generalized Fibonacci matrices, the Qp-matrices,
for encryption and decryption of the initial message.
Let us represent an initial message in the form of the
square matrix m of the size (p+1) (p+1), where p=0,
n
of the size (p+1) (p+1) as an encryption matrix and
−n
its inverse matrix Q of the same size as a decryption
p
matrix. Table 3.1 demonstrates the general idea of the
Fibonacci encryption/decryption algorithm.
Table 3.1: Fibonacci encryption/decryption algorithm
Encryption Decryption
E = M × Qpn M = E × Qp− n
Let us now consider the following transformations
based on matrix multiplication:
Note that the encryption/decryption key is the pair of
the numbers of p and n. Since p = 0, 1, 2, 3, .. and n =
1, 2, 3, ... this means that this method has
theoretically we can use unlimited number of the
encryption /decryption keys.
Let's consider the Fibonacci encryption method:
E = M × Qpn (3.8)
And then the Fibonacci decryption method
M = E × Qp− n (3.9)
It follows from eq.(3.8) and eq.(3.9) that the
Fibonacci encryption algorithm eq.(3.8) is reduced to
the n times multiplication of the initial matrix M by
the matrix Qp and the Fibonacci decryption algorithm
is reduced to the n-multiple multiplication of the
−1
secret message E by the inverse matrix Q p .
Note that for the case p=0 the matrix Qp reduces to
the trivial matrix Q0 = (1) and for this case the
encryption/decryption method given by Table 3.1 is
trivial. For the case p=1 the matrix Qp reduces to the
classical Q-matrix eq.(2.8).
Following terms are used in Fibonacci
Where,
M - Message Matrix,
Q - Matrix generated from Fibonacci series.
p - Message matrix i.e. (p+1) (p+1) size and
n - nth power of Q- matrix i.e. key
3.2 Fibonacci Series Coding/Decoding
To develop new coding theory based on the Q p -
n 1. Read the contents of the source file and store it
in one dimensional array named file.
matrices since the simplest Fibonacci Q-matrix. Let's
2. Calculate the number of padding bit required.
consider the following method of coding. Let's
3. Get the extension of the source file.
represent the initial message in form of the 2 × 2 4. Allocate the buffer named File Data. It stores the
m m 
adder bit and file extension.
matrixes: M =  m m 
1 2
(3. 1)
 3 4  5. Copy the entire content of the file which was
Let us assume that all elements of the matrix eq.(3.1) previously stored in file variable into File Data.
are positive integers, that is: 6. Allocate the 2D array of size (p+1) (p+1). Then
m1>0; m2>0; m3>0; m4>0 copy the content of the File Data into this 2D
The simplest method e.g. considers a text message is array, let us say 2D array as M i.e. Message
the sequence of the decimal numerals: Matrix.
358 091 466 725. (3.2) 7. Generate Fibonacci Series as per the values of p
Then I can represent this message (3. 2) in the matrix & n.
 358 091 8. Create Qpn matrix depending upon the value of p
form: M =  (3.3)
 466 725 and n from Fibonacci Series l and neg_l, i.e.,
Suppose now that we have selected for coding a positive and negative series respectively.
Fibonacci Q-matrix of the 5th power: 9. Convolution of Qpn and M matrix to get the
8 
5 resultant value and store these contents in Binary
Q5 =   (3.4)
5 3
 format. i.e. Encrypted Data (E).
At the preceding pages I have introduced the notion
of the matrix "inverse" to eq.(3.4). Because the 3.4 Fibonacci Series Decryption algorithm
number 5 is odd than the matrix "inverse" to eq. (3.4)
has the following form: 1. Read the contents of the encrypted file.
 −3 5  2. Create the buffer of the size (p+1) (p+1) and
Q −5 =   transfer the content from file variable into this
 5 −8  buffer.
Then, the Fibonacci coding of the message M given 3. Let say this buffer as E i.e. Encryption data
in the matrix form eq.(3.1) consists of the Matrix
multiplication of the initial matrix eq.(3.1) by the 4. Generate Fibonacci Series as per the values of p
coding matrix eq.(3.4) that is: & n.
m m2  8  5 8 + 5m1 5m2 3m+m1 1' m2'  
M × Q5  =1 × =  (3.5)
 E = 5. −n
Generate= Q inverse matrix by using this
m4  5  3 8 + 5m3 5m4  p

 m3 3m+m3 3' m4'   Fibonacci Series. Which is stored l and neg_l

m1' = 8m1 + 5m2
i.e. +ve & -ve series respectively.
m2' = 5 m1 + 3m2
Where, (3.6) 6. Then Q & E Matrix is convolution
−n
p

m3' = 8 m3 + 5m4
7. Resultant value is manipulated depending upon
m4' = 5 m3 + 3m4 the counter value if the counter value is 1 the
We remember that the "matrix multiplication" is resultant values represent the padding bit.
mathematical operation distinguished from the 8. If the resultant value of counter in the range of
traditional "multiplication". We can see from the 2-4, the convolution value represents file
example eq.(3.5) that the product of two square extension of the counter.
matrices M and Q5 is the matrix E of the same size, 9. The convolution values are written to the File.
which elements are calculated according to i.e. original message (M).
(3..6).Let's apply my calculations to our example eq.
(3.3). Then the procedure of the Fibonacci coding 3.5 Graphical Password
brings us into the following matrix E: A graphical password is an authentication system that
3 58 09 1 8 5 × 8  +3 5 8 × 5 9 1 5 × 3 5 8 +3 9×1 3319 3 
2 0 6works   user
M× Q  =
5
5 × = E by
= having the select from images, in a
=
466 725  3 × 8  4+ 6 6  × 5 7 2 5 5 × 4 6 6 3+ 7 ×2 5 7353 5 
4 5 0specific 
 order, presented
 in
a graphical user interface
After that the coded message (GUI). For this reason, the graphical-password
E = m1' m2' m3' m4' = 3319206373534505 is sent to the approach is sometimes called graphical user
communication channel. authentication (GUA).
A graphical password is easier than a text-based
3.3 Fibonacci Series Encryption algorithm password for most people to remember. Suppose an
8-character password is necessary to gain entry into a
particular computer network. Instead of numerical

5
character, for example, a user might select images
from the image file.
Graphical passwords may offer better security than
text-based passwords because many people, in an
attempt to memorize text-based passwords, use plain
words (rather than the recommended jumble of
characters). A dictionary search can often hit on a
password and allow a hacker to gain entry into a
system in seconds. But if a series of selectable
images is used on successive screen pages, and if
there are many images on each page, a hacker must
try every possible combination at random. If there are
100 images on each of the 8 pages in an 8-image
password, there are 1008 possible combinations that
could form the graphical password, According the
concepts of graphical password, possible
combinations are 2’s power of 640x480 due to the
image size is 640 x 480. The value of p and n are
calculated from the standard deviation of the x and y
coordinates the following formulas are used to
calculate the p and n.
p = ∑ { ( Xi max X) gridnumber}
n = ∑ { ( Yi max Y) gridnumber}
Where,
Xi and Yi are the co-ordinates
p - Message matrix size
n - Numerical key generate through above formula.
Where user had clicked on the image from the above
formulae, we can generate random values of p and n,
i.e. numerical keys are generated. We can use this
key for file encryption/decryption.
4 Implementation and Testing
4.1. The C# Platform:
1. C# is considered platform independent because
this feature of C# makes sure that the programs
will run on any platform. Thus, the implemented
algorithm can be tested on a variety of platforms
for comparison purposes.
2. C# provides a large library of built-in classes and
methods that assist the programmer in writing
code for cryptographic algorithms. For example,
the Int32 Integer class in c# Conversion from
integer to string and vice versa. Dot net provides
in built classes File Info Binary Reader, Binary
Writer, Stream Reader, and Stream Writer, are
used for file reading and writing in binary
format.
3. Fibonacci Series algorithm was implemented as
is, using a C sharp language, and was tested on a
different platform.
6
4.2. Measuring Execution Time Methodology
Performance measurements were conducted by
determining the amount of time required to perform
cryptographic operations of an algorithm. I measured
how many bytes of data could be encrypted in one
second. We measured the time taken to perform a
particular operation. We used the stopwatch to
calculate the execution time for data Encrypt/Decrypt
[12]. API to calculate the processor time consumed in
the execution of the algorithms. A tick counts which
increments 100 times per second when the algorithm
is in the running mode. This stopwatch is initialized
to zero every time when it is reset. Since the rate of
the tick count is not so high, several iterations of the
same operation are required to be carried out in order
to achieve a finer resolution on the speed of that
operation. Execution time is manipulated after every
10ms .For this algorithm, a number of tests was
conducted.
4.3. Measuring Execution Times
Measuring Execution Times Obtaining accurate and
repeatable execution time measurements proved to be
more difficult than was originally anticipated. After
many experiments, it was decided to settle on the use
of a Pentium-III 700 MHz machine (running
Microsoft Windows operating system) and a
Pentium-4, 2.4 GHz machine (running Microsoft
Windows XP operating system)[10] as the basis for
time measurements. Because the primary goal was to
measure the encryption/decryption times of
algorithms, the initialization and key set-up times
were excluded from the comparison. Also, because
decryption time is generally the same as encryption
time for almost all the algorithms, therefore only the
encryption times are taken for comparison.
4.4. Performance Results for Block Ciphers
The execution results of symmetric key algorithms in
ECB (Electronic Codebook) mode are presented first.
These results are shown Table 4.1and Table 4.2, for
execution of code on a Pentium-III 700 MHz
machine, and Pentium-4, 2.4 GHz machine
respectively.
 *All the data above table is according the ref. [10].
Input file *DES *3DES *AES *BF FC
size (KB) Table 4.1: Comparative execution times (in sec) of
20.05 2 7 4 2 0
algorithms in ECB Mode on a Pentium-III, 700 MHz
35.16 4 13 6 3 0
44.45 5 17 8 4 0 machine
58.50 7 23 11 6 0
68.00 9 26 13 7 0
134.1 17 51 26 14 0
155.35 20 60 30 16 0
162.50 21 62 31 17 5
187.00 24 72 36 19 10
227.00 30 87 44 24 22
1085.44 - - - - 55
4454.40 - - - - 190
11673.60 - - - - 225
21606.40 - - - - 414
29593.60 - - - - 743

Fig 4.1: Performance graph DES and Fibonacci

Table 4.2: Comparative Execution Times (in

seconds) of algorithms in ECB mode on a Pentium-
4.2.4 GHz machine
Input file *DES *3DES *AES *BF FC
*All the data above table is according the ref.[10].
size (KB)
20.05 24 72 39 19 6
35.16 48 123 74 35 10
44.45 57 156 94 46 12
58.50 74 202 126 58 15
68.00 83 243 143585 67 20
134.1 160 451 324 135 38
155.35 190 543 355 158 42
162.50 198 569 378 162 44
187.00 227 655 460 176 46
227.00 275 799 228 219 48
1085.44 - - - - 54
4454.40 - - - - 229
11673.60 - - - - 575
21606.40 - - - - 1176
29593.60 - - - - 1598

Fig. 4.2: Performance graph DES and Fibonacci

Encryption Algorithm on a Pentium 4.2.4 GHz
machine

4.5. Performance Results for Different File

Sizes and Formats

In my paper work, I have tested different sizes of

files and formats with their encryption and decryption
execution time. Following table shows the execution
time (ms) with file size (KB). The Fibonacci
Encryption/Decryption algorithm the execution time
was measured to any type of file format.

Table 4.3: Comparative execution times (in sec) of

Fibonacci Encryption/Decryption algorithm in
different files size & format mode on a Pentium-4,
3.06 GHz machine

7
 A proposed direction for the future work could be to
I/P file size File format type analyze the performance/security trade-off in greater
DOC AVI MP3 PPT DAT depth. For instance, the impact of these and other
(KB)
41.00 KB 0.00 0.00 0.00 0.00 0.00 such factors on the overall performance of an
62.00 KB 0.00 0.00 0.00 0.00 0.00 algorithm needs to be measured.
227.00 KB 0.04 0.05 0.05 0.05 0.05
515.00 KB 0.11 0.12 0.11 0.11 0.12
1.06 MB 0.18 0.19 0.20 0.18 0.20 References
2.32 MB 0.43 0.45 0.45 0.43 0.44
5.10 MB 1.05 1.05 1.04 1.30 1.05 [1] W. Diffie and M. E. Hellman, “New directions in
11.70 MB 2.45 2.47 2.44 2.48 2.41
40.4 MB 9.37 9.40 9.38 9.38 9.36
cryptography,” IEEE Trans. Inform Theory, vol. IT-
49.30 MB 10.6 10.7 10.6 10.6 10.62 22, pp. 644–654, Nov. 1976
5 1 8 3
[2] R. L. Rivest, A. Shamir, and L. Adleman, “A
method for obtaining digital signatures and public-
In my paper work, I measured file key cryptosystems”, Commun. ACM, vol. 21, no. 2,
Encryption/Decryption time for different file size as pp, 120–126, Feb.1978.
well as different files format, as per the results was [3] Gary C. Kessler,” An Overview of
getting to encrypt/decrypt file the execution time is Cryptography”, McGraw-Hill, May 1998.
same. Only the difference is ±0.05 ms. [4] Duncan S. Wong, Hector Ho Fuentes and Agnes
H. Chan, “The Performance Measurement of
5 Conclusion Cryptographic Primitives on Palm Devices”,IEEE
MILCOM 2001 Conference Proceedings, Oct 2001.
The Fibonacci encryption/decryption algorithm is the [5] Schneider, B.:"Description of a New Variable-
main application of the Fibonacci Qp- matrices. Length Key, 64-Bit Block Cipher (Blowfish)", Fast
Fibonacci encryption/decryption algorithm reduces to Software encryption, Cambridge Security Workshop
matrix multiplication, i.e. to well-known algebraic Proceedings Dec. 1993.
operation, which is realized very well in modern [6 Atul Kahate,“Cryptography and Network
computers. The performance of the popular secret Security”, Tata McGraw-Hill,2003.
key algorithms including DES, 3DES, AES and [7] Christian Nagel, Bill Evjen, Jay Glynn, Morgan
Blowfish, is compared with Fibonacci Series Skinner, Karli Watson, Allen Jones,” Professional
encryption by encrypting input files of varying C# 2005”, Wrox , Wiley Publication.
contents and sizes. The present Fibonacci [8] Aamer Nadeem, Dr. M.Y.Younus Javed, “A
encryption/decryption algorithm is implemented in a Performance Comparison of Data Encryption
C sharp language, and tested on two different Intel Algorithms”, 2005 IEEE.
processors, to compare its performance. At present [9] Jiancheng Zou , Rabab K. Ward , Dongxu Qi, “
Fibonacci Series Algorithm is used for securing input A New digital image Scrambling method based on
files of varying contents and sizes. Thus a demo of Fibonacci Numbers”, 2004, IEEE.
new techniques of Encryption, Decryption in any [10] Najib A. Kofahi, Turki Al-Somani and Khalid
type file is being presented in my paper. The results Ai-Zamil, “Performance Evaluation of Three
reveal that Fibonacci encryption is the fastest among Encryption/Decryption Algoriithms”, 2004 IEEE.
symmetric algorithms. Another advantage of this [11] A.P. Stakhov, “Fibonacci Matrices, A
algorithm is the use of graphical password to Generalization of the “Cassini Formula”, and new
generate numerical key. coding theory”, Chaos, Solitons and Fractals,
Thus the implemented algorithm finds its place in Volume 30, Issue 1, 2006,
variety of applications such as e-commerce, banking, [12] A.P. Stakhov, “Fibonacci Matrices, A
and online transaction processing applications, small Generalization of the “Cassini Formula”, and new
or large-scale industry, Internet communication, coding theory”, Chaos, Elsevier, Volume 30, Issue 1,
multimedia systems, medical imaging, telemedicine, 15 Feb 2006.
and military communication, Software Developers,
Personal use, Educational, Business, and Banking
etc.