The document proposes a new cryptographic algorithm to improve data security within networks. It begins with an introduction to information security and cryptography. It then describes the proposed algorithm which uses logical and shifting operations on 512-bit keys to encrypt data in blocks. The algorithm encrypts messages multiple times for enhanced security. Experimental results show the algorithm has better speed and encryption strength compared to other algorithms like AES and DJSA. It concludes the proposed algorithm is more efficient and secure for data transmission within networks and distributed systems.

1. 
Abstract— Information security is the process of
protecting information .It protects its availability,
privacy and integrity .Access to stored information
on computer databases has increased greatly. More
company’s stores business and individual
information on computer then even before. Much
of the information is highly confidential and not
for public viewing. So to sort out this problem we
have developed a new cryptographic algorithm.
We use cryptographic approach of data security
because cryptography is where security
engineering meets mathematics. It provides us
with tools that underline most modern security
protocols.
In this algorithm we have used logical operations
like XOR and shifting Operations like left shift,
right shift.
Experimental results shows this algorithm is very
efficient and secured. To write this paper we have
studied about information security using
cryptography and security among distributed
systems, we are presenting our proposed work.
This paper is divided into four sections.
i) We are presenting just basic introduction about
information security using cryptography technique.
ii)Here we are presenting detail description
information security using cryptography.
iii) Here we are presenting our proposed algorithm
iv)Here we are presenting summary and references
from where we have completed our research.
The proposed algorithm has better speed compared
with comparing encryption algorithm
And helps in data security within networks and
among distributed systems very efficiently.
I: INTRODUCTION
Cryptography refers to the science and art of
designing ciphers, cryptanalysis to the science and
art of breaking them while cryptology, often
shortened to just crypto, is the study of both
cryptography and crypto analysis. The input to an
encryption process is commonly called plaintext,
and output the cipher text. Thereafter things get
somewhat complicated. There are number of
cryptographic primitive’s basic building blocks,
such as block ciphers, stream ciphers, and hash
functions. Block ciphers may either have one key
for both encryption and decryption, in which case
they are called shared key(symmetric) or have
separate keys for encryption and decryption in
which they are called(public key). A digital
Improving Data Security within Networks Using New
Cryptography Algorithm
Sumit Bajaj (sumitbajaj199@gmail.com) Ayush Tripathi (atasmith20@gmail.com)
Hina Muqtida (hinasarah120141@gmail.com) Deepika Saxena (dsdeepika.saxena.02@gmail.com)
Students B.Tech. (Computer Science and Engineering) SRMSCET, Bareilly
Mr.Pravesh Kumar Bansal(bansal086@gmail.com) Ms. Arti Mishra(mishra.arti199@gmail.com)
Mrs.Preeti Pandey (preeti0412.pandey@gmail.com) Mr.Amit Karmakar (amit.karmakar82@gmail.com)
Assistant Professors (Computer Science and Engineering), SRMSCET, Bareilly

2. signature scheme is a special type of asymmetric
primitive. In stream chippers we have random
oracle whose length is fixed while output is very
long stream of bits known as key stream. It can be
used to quite simply to protest the confidentiality
of backup data: we go the key stream generator,
enter a key, get a key, and get a long file of
random bits and exclusive-or it with our plaintext
data to get cipher text which we then send to our
backup constructor. Hash function is a random
function which means one-wetness. It accepts an
input string of any length, and outputs a random
string of fixed length, say n bits long. The output
of hash function is known as hash value or
message digest and input corresponding to have
value in its reimage. Digital signature is that a
signature on a message can be created by only one
person but checked by anyone. It is defined as
random function that reduces any input message to
a one way hash value of fixed length.
The main feature of encryption and decryption
program implementation is the generation of the
encryption key. Now a days, cryptography has
many commercial applications. If we are
protecting confidential information then
cryptography provides high level of privacy of
individuals and groups. However .the main
purpose of the cryptography is used not only to
provide solutions for other problems like: data
integrity, authentication, non-repudiation.
Cryptography is the methods that allow
information to be sent in a secure from in such a
way that the only receiver able to retrieve this
information. Presently continuous researches on
the new cryptographic algorithms are going on.
However it is very difficult to find out the specific
algorithms, because we have already known that
they must consider many factors like security, the
features of algorithms, and the time complexity
and space complexity.
II. SECURITY SERVICES:
If we are talking about security of information then
following services come in mind.
i) Confidentiality (privacy).
ii) Authentication (who created or sent the data).
iii) Integrity (has not been altered).
iv) Non-repudiation (the order is final).
v) Access Control (present misuse of resources).
vi) Availability (permanence, non-erasure).
III. SOME ALGORITHM USED
A newly systematic cryptography algorithm using
extended MSA method In this they are suggesting
a systematic key method where they have used to
random key generator for generating the initial key
and that key is used for encrypting the given
source file. In this method we use substitution
method where they take four characters from any
input files and then search the corresponding
characters in the random key matrix file. After
getting encrypted message they store encrypted
data in other file.
For searching characters from random key matrix
we have used a method which was proposed by
NATH in MSA algorithm. In that we have the
provision for encrypting message multiple times.
The key matrix contains all possible worlds
comprising of 2 characters each generated from all
characters whose ASCII code is from 0 to 255 in
random order. The pattern of key matrix will
depend on text key entered by user. We have used
a algorithm to obtain randomization number and
encryption number initial text key. They have
given a long trail run on text key and they have
found that it is difficult to match the above two

3. parameters from different text key ie we should
know exact pattern of text key to encrypt the
message. To decrypt any file we have to know
exactly what key matrix is and to find randomize
matrix theoretically we have to apply 65536! Trial
run which is difficult. This have applied this on
possible files such as executable file, Microsoft
word, excel, access database, encrypting digital
signature, watermark etc. and get 100% correct
solution. AES (Advanced encryption standard) in
this they describe about symmetric cipher
algorithm which is similar to Rijindael. the
difference is that, rijindael algorithm starts with
128 bit block size and then increase block size by
appending columns, whereas this algorithm start
with 200 bits.
IV. Proposed work
In this section we are presenting new block based
symmetry cryptography algorithm.in this
technique we are using random numbers for
generating the initial key, where this key is used
for encrypting the given source file using proposed
encryption algorithm using encryption number.
Basically in this technique block based
substitution method will use.in present technique
we are encrypting messages multiple times. The
proposed key blocks contains all possible worlds
comprising of numbers of characters each
generated from all characters whose ASCII code
is from 0-255 in random order. The pattern of key
block will depend on text key entered by user. Our
proposed system using 512 bits key size to encrypt
text messages. We know that symmetric
encryption approach is divide in two type one is
block cipher symmetric cryptography and other is
stream cipher symmetric cryptography. But here
we are using block cipher type because its
efficiency and security is very high. In our
proposed technique we have a common key
between sender and receiver, which is known as
private key. Basically private key concepts is the
symmetric key concepts where plain text is
converting into encrypted text known as cipher
text using private key where cipher text decrypted
by some key into plain text. The keys in practice
represents a shared secret between two or more
parties that can be used to maintain private
information .basic concepts of symmetric
cryptography is shown in R2.
V. REASONS FOR USE OF SYMMETRIC APPROACH
FOR ENCRYPTION AND DECRYPTION
i) The encryption process is simple.
ii) Security is dependent on the length of the key
iii) High rates of data throughput.
iv) Keys for symmetric key ciphers are relatively
short.
v) Symmetric key ciphers can be used as
primitives to construct various cryptographic
mechanisms.
vi) They can be composed to produce stronger
ciphers.
VI. Proposed key generation steps
1) Select or create any private key of size 256*2
bits or 64 characters.
2) Size of selected key may vary from 128 to 512
bits or 16 to 64 characters.
3) We can choose any characters from 0 to 255
ASCII code.
4) Use of 64*8 keys that means 512 bits in length.

4. 5) Divide 64 bytes into 4 blocks of 16 bytes like
keyblock1, keyblock2, keyblock3, keyblock4.
6) Apply XOR operation between block1 and
block3, result will store in mew key block A.
7) Apply XOR operation between key block 2 and
block A, result will store in mew keyblock2 A.
8) Apply XOR operation between keyblock2A and
key block 4, result will store in mew key block
42A.
9) Repeat step 7, 8, 9 till (random number /4)
10) Exit
VII. Steps for proposed algorithm
1) Initially select plane text of 16 bytes (16to 64).
2) Initially insert key of size 16 bytes (depend on
plane text value).
3) Apply XOR operation between key. (Key block
42A) and plain text block (text block).result will
store in cipher block 1.
4) Apply right circular shift with 3 values .result
will store in new cipher block2.
5) Apply XOR operation between cipherblock2
and keyblock2.result will store in cipher block 3.
6) Apply XOR operation between cipherblock3
and cipherblock4.result will store in cipher block
4.
7) Cipherblock4 is the input of the next round as a
plain text block.
8) Repeat step 1-7 till (encryption no /4)
9) Exit
VIII. Result Comparisons
Here we are using two parameters for execution
one is encryption value and second one is
decryption time. Here we are doing comparing of
execution time of encrypting plain text. On
different existing cryptographic with our proposed
cryptography algorithm. In each cycle, some
plaintexts are represented by DJSA symmetric key
algorithms Methodology and Proposed algorithm.
Finally output is measured in numeric form. We
can say that execution time of execution time of
encryption not only depends on algorithm
complexity but also the key and plaintext have
certain impact.
We are showing results of text file.
Encryption time:
Plain Text in size DJSA algo AES Methodology Proposed algo
1.66mb.txt 0:01:34 0:01:32 0:01:25
560kb.txt 0:00:34 0:00:28 0:00:28
187kb.txt 0:00:18 0:00:09 0:00:09
46kb.txt 0:00:10 0:00:08 0:00:01
Decryption table:
Plain Text in size DJSA algo AES Methodology Proposed algo
1.66mb.txt 0:01:34 0:01:32 0:01:25
560kb.txt 0:00:37 0:00:35 0:00:28
187kb.txt 0:00:18 0:00:16 0:00:09
46kb.txt 0:00:11 0:00:09 0:00:01
Characteristics of proposed Technique:
1) Simplicity
2) Security
3) Efficiency
4) Robustness
5) Availability
6) Distribution
7) Flexibility
8) Time efficiency
IX. Conclusion
From result it is clear that our "proposed
Technique" is better result producing as compared
to DJSA and AES algorithm. If any user emphasis
on security than he can use our proposed
algorithm. our method is block cipher so it take
less time if file size is large .The important thing
of our proposed method is that it is almost
impossible to break the encryption algorithms

5. without knowing exact key value. So, we can send
any confidential information easily.
REFERENCES
[1]Schneier, Bruce – Secrets and Lies, Wiley, ISBN 0-471-
25311-1
[2]IEEE 1363: Standard Specifications for Public-Key
Cryptography
[3] Christof Paar, Jan Pelzl, "Introduction to Public-Key
Cryptography", Chapter 6 of "Understanding Cryptography,
A Textbook for Students and Practitioners". (Companion
web site contains online cryptography course that covers
public-key cryptography), Springer, 2009.
[4] Garfinkel, Simson (December 1, 1994), PGP: Pretty
Good Privacy, O'Reilly Media, pp. 101–102, ISBN 978-1-
56592-098-9
[5] Ferguson, Niels; Schneier, Bruce (2003). Practical
Cryptography. Wiley. ISBN 0-471-22357-3.
[6] The Internet Encyclopedia, by Hossein Bidgoli, John
Wiley, 2004, ISBN 0-471-22201-1, p. 567
[7] Matthew Copeland; Joergen Grahn; David A. Wheeler
(1999). Mike Ashley, ed. "The GNU Privacy
Handbook". GnuPG. Retrieved 14 December 2013.