SlideShare une entreprise Scribd logo
1  sur  9
Télécharger pour lire hors ligne
IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 1 (Jul. - Aug. 2013), PP 138-146
www.iosrjournals.org
www.iosrjournals.org 138 | Page
A Block Cipher Based Cryptosystem through Modified Forward
Backward Overlapped Modulo Arithmetic Technique
(MFBOMAT)
Debajyoti Guha1
, Rajdeep Chakraborty2
, Abhirup Sinha3
1
Dept. of IT, Siliguri Institute of Technology,Darjeeling-734009, West Bengal, India.
2
Dept of CSE, Netaji Subhash Engineering College, Garia , Kolkata-700152, West Bengal, India.
3
Tata Consultancy Services, New Town, Rajarhat, Kolkata-700156,West Bengal, India.
Abstract: In this paper, a new Cryptosystem based on block cipher has been proposed where the encryption is
done through Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT). The
original message is considered as a stream of bits, which is then divided into a number of blocks, each
containing n bits, where n is any one of 2, 4, 8, 16, 32, 64, 128, 256. The first and last blocks are then added
where the modulus of addition is 2n
. The result replaces the last block (say Nth
block), first block remaining
unchanged (Forward mode). In the next attempt the second and the Nth
block (the changed block) are added and
the result replaces the second block(Backward mode).Again the second (the changed block) and the (N-1)th
block are added and the result replaces the (N-1)th
block (Forward mode).The modulo addition has been
implemented in a very simple manner where the carry out of the MSB is discarded to get the result. The
technique is applied in a cascaded manner by varying the block size from 2 to 256. The whole technique has
been implemented by using a modulo subtraction technique for decryption.
Keywords: FBOMAT, Symmetric block cipher, Cryptosystem
I. Introduction
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 be kept
secret from others [2]. A very important reason to encode data or messages is to keep them secret. From e-mail
to cellular communication, from secured web access to digital cash, cryptography [3] is an essential part of
today’s information systems. It can prevent fraud in electronic commerce and assure the validity of financial
transactions. It can prove one’s identity and protect one’s anonymity. These electronic commerce schemes may
fall fraud through forgery, misrepresentation, denial of service and cheating if we do not add security to these
systems. In fact, computerization makes the risks even greater by allowing attacks that are impossible in non-
automated systems. Only strong cryptography can protect against these attacks.
The Section I of this paper deals with the proposed scheme. A concept of key-generation is given in
Section II. Results and comparisons are illustrated in Section III. Conclusions are drawn in Section IV,
acknowledgements are shown in section V and Section VI lists the references.
1. The Modified Forward Backward Modulo Arithmetic Technique (MFBOMAT)
In the proposed scheme the source file is input as streams of binary bits. For our implementation we
have taken the stream size to be 512 bits though the scheme may be implemented for larger stream sizes also.
The input stream, S, is first broken into a number of blocks, each containing n bits (n=2k
,
k=1,2,3,......,8) so that S = B1B2B3.......B m where m=512/n. Starting from the MSB, the blocks are paired as
(B1,Bm), (B2,Bm), (B2,Bm-1),(B3,Bm-1) and so on. So there is a common member in any two non-adjacent block-
pairs, i.e. the block-pairs are overlapping and hence the name given to the technique The FBOMAT operation is
applied to each pair of blocks. The process is repeated, each time increasing the block size till n=256.The
proposed scheme has been implemented by using the reverse technique, i.e. modulo subtraction technique, for
decryption. Section 1.1 explains the operation in detail.
1.1. The Algorithm for MFBOMAT
After breaking the input stream into blocks of 2 bits each and pairing the blocks as explained in Section
1, the following operations are performed starting from the most significant side:
Round 1: In each pair of blocks, the first member of the pair is added to the second member where the modulus
of addition is 2n
for block size n. Therefore for 2-bit blocks, the modulus of addition will be 4. This round is
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 139 | Page
repeated for a finite number of times and the number of iterations will form a part of the session key as
discussed in Section 3.
Round 2: The same operation as in Round 1 is performed with block size 4.
In this fashion several rounds are completed till we reach Round 8 where the block size is 256 and we get the
encrypted bit-stream. The operations of the non adjacent block-pairs increases the complexity of the algorithm
resulting in the enhancement of security.
During decryption, the reverse operation, i.e. modulo subtraction, is performed instead of modulo
addition, starting from the blocks B m/2 and ((B m) /2) +1 and then ((B m)/2) and ((B m) /2) +2 and then ((B m)/2)-
1 and ((B m) /2) +2 .The process continues until all the remaining blocks are decrypted.
.
1.1. The Modulo Addition
An alternative method for modulo addition is proposed here to make the calculations simple. The need for
computation of decimal equivalents of the blocks is avoided here since we will get large decimal integer values
for large binary blocks. The method proposed here is just to discard the carry out of the MSB after the addition
to get the result. For example, if we add 1101 and 1001 we get 10110. In terms of decimal values, 13+9=22.
Since the modulus of addition is 16 (24
) in this case, the result of addition should be 6 (22-16=6). Discarding the
carry from 10110 is equivalent to subtracting 10000 (i.e. 16 in decimal). So the result will be 0110, which is
equivalent to 6 in decimal. The same is applicable to any block size.
1.2. Example of the Scheme
Although the proposed scheme is applied to a 512-bit input stream, for the sake of brevity, consider a stream of
32 bits, say S = 1101001100011011 each round is performed only once to make the process simple for
understanding.
1.2.1 The Encryption Scheme
Round 1: Block size = 2, number of blocks = 8
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 140 | Page
Input
(B2, B3) mod16, Change B3
Round 3: Block size = 8, number of blocks = 2
Input
11111010 00000101
B1 B2
Output
11111010 11111111
B1 B2
(B1, B2) mod 256, Change B2
Since we have considered only a 16-bit stream we cannot proceed further. The output from Round 3, say S', is
the encrypted stream, i.e. S' =.1111101011111111.For decryption the opposite method i.e. modular subtraction
is used to get back the original bit stream in S.
1.2.2 The Decryption Scheme
For decryption the opposite method i.e. modular subtraction is used to get back the original bit stream in S.
Round 1:Block size=8, number of blocks =2
Input
11111010 11111111
B1 B2
Output
11111010 00000101
B1 B2
(B1, B2) mod 256, Change B2
Round 2:Block size=4, number of blocks=4
Input
1111 1010 0000 0101
B1 B2 B3 B4
Output
1111 1010 0110 0101
B1 B2 B3 B4
(B2, B3) mod16, Change B3
Input
1111 1010 0110 0101
B1 B2 B3 B4
Output
1111 0101 0110 0101
B1 B2 B3 B4
(B2, B4) mod16, Change B2
Input
1111 0101 0110 0101
B1 B2 B3 B4
Output
1111 0101 0110 0110
B1 B2 B3 B4
(B1, B4) mod4, Change B4
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 141 | Page
Round 3:Block size=2, number of blocks =8
Input
11 11 01 01 01 10 01 10
B1 B2 B3 B4 B5 B6 B7 B8
Output
11 11 01 01 00 10 01 10
B1 B2 B3 B4 B5 B6 B7 B8
(B4, B5) mod4, Change B5
Input
11 11 01 01 00 10 01 10
B1 B2 B3 B4 B5 B6 B7 B8
Output
11 11 01 11 00 10 01 10
B1 B2 B3 B4 B5 B6 B7 B8
(B4, B6) mod4, Change B4
Input
11 11 01 11 00 10 01 10
B1 B2 B3 B4 B5 B6 B7 B8
11 11 01 11 00 01 01 10
B1 B2 B3 B4 B5 B6 B7 B8
(B3, B6) mod4, Change B6
Input
11 11 01 11 00 01 01 10
B1 B2 B3 B4 B5 B6 B7 B8
Output
11 11 00 11 00 01 01 10
B1 B2 B3 B4 B5 B6 B7 B8
(B3, B7) mod4, Change B3
Input
11 11 00 11 00 01 01 10
B1 B2 B3 B4 B5 B6 B7 B8
Output
11 11 00 11 00 01 10 10
B1 B2 B3 B4 B5 B6 B7 B8
(B2, B7) mod4, Change B7
Input
11 11 00 11 00 01 10 10
B1 B2 B3 B4 B5 B6 B7 B8
Output
11 01 00 11 00 01 10 10
B1 B2 B3 B4 B5 B6 B7 B8
(B2, B8) mod4, Change B2
Input
11 01 00 11 00 01 10 10
B1 B2 B3 B4 B5 B6 B7 B8
Output
11 01 00 11 00 01 10 11
B1 B2 B3 B4 B5 B6 B7 B8
(B1, B8) mod4, Change B8
The decrypted bit stream :S”=1101001100011011.So S=S”.
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 142 | Page
II. Key Generation
In the proposed scheme, eight rounds have been considered, each for 2, 4, 8, 16, 32, 64, 128, and 256
block size. As mentioned in Section 2.1, each round is repeated for a finite number of times and the number of
iterations will form a part of the encryption-key. Although the key may be formed in many ways, for the sake of
brevity it is proposed to represent the number of iterations in each round by a 16-bit binary string. The binary
strings are then concatenated to form a 128-bit key for a particular key. Example in Section 3.1 illustrates the
key generation process.
2.1. Example of Key Generation
Consider a particular session where the source file is encrypted using iterations for block sizes 2, 4, 8,
16, 32, 64, 128, and 256 bits, respectively. Table 1 shows the corresponding binary value for the number of
iterations in
Table 1 : Representation of no. of iterations in each round by bits.
Round
No.
Block
Size
No. of Iterations
Decimal Binary
1 2 74 0000000001001010
2 4 680 0000001010101000
3 8 4278 0001000010110110
4 16 44428 1010110110001100
5 32 44443 1010110110011011
6 64 48878 1011111011101110
7 128 49870 1100001011001110
8 256 50020 1100001101100100
Each round. The binary strings are concatenated together to form the 128-bit binary string :
000000000100101000000010101010000001000010110110101011011000110010101101100110111011111011
10111011000010110011101100001101100100.. This 128-bit binary string will be the encryption-key for this
particular session. During decryption, the same key is taken to iterate each round of modulo-subtraction for the
specified number of times.
III. Results and Comparisons
The variation of frequencies of all the 256 ASCII characters between the source file and the encrypted
file are given in this section. The evenly distribution of character frequency over the 0-255 region of the
encrypted file
Fig. 1 : Frequency Distribution of ASCII characters in the source files.
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 143 | Page
Fig. 2 : Frequency Distribution of ASCII characters MFBOMAT encrypted files
Against the source file ensures better security provided by the proposed algorithm and it also shows the
heterogeneity between the two files. The frequency distribution graph is drawn according to the percentage of
occurrence of a particular character, not the total number of occurrence.
Fig. 3 : Frequency Distribution of ASCII characters in the RSA encrypted file.
Fig. 4 : Frequency Distribution of ASCII characters in the FBOMAT encrypted file.
Although ten different text files were encrypted and decrypted using both RSA and MFBOMAT, only
one such file is considered here for analyzing the results. Figs. 1, 2,3and 4 illustrate the frequencies of
occurrence of all the 256 ASCII characters in the source file, encrypted file with MFBOMAT, and encrypted file
with RSA and FBOMAT. A close observation will reveal that the characters in the encrypted file using
MFBOMAT are fairly well distributed throughout the character space. Hence the MFBOMAT scheme may be
comparable with RSA and FBOMAT. Another way to analyze the scheme is to test the homogeneity of the
source and the encrypted file. The Chi-Square test has been performed for this purpose. Table 2 and fig 5 shows
the source file name, size and the corresponding Chi-Square values (using MFBOMAT, RSA, FBOMAT) for
ten different files. Barring some exceptions we see that the Chi-Square value increases with the increase in file
size. Further, the high values prove that Chi-Square is highly significant at 1% level of significance.
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 144 | Page
Table 2 : Test for homogeneity using Chi-Square method.
Fig. 5 : Graph showing Chi-Square values for MFBOMAT, FBOMAT and RSA
Hence the source and the corresponding encrypted files are considered to be heterogeneous.
Another way to analyze the scheme is to analysis the encryption and decryption time.
Table 3: indicates encryption time for MFBOMAT, FBOMAT and RSA
Fig 6: shows graphically Time Complexity Analysis among MFBOMAT, FBOMAT & RSA for Encryption.
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 145 | Page
Table 4: indicates decryption time for MFBOMAT, FBOMAT and RSA
Fig 7: shows graphically Time Complexity Analysis among MFBOMAT, FBOMAT and RSA for Decryption
It can be seen that the time taken to encrypt a file using MFBOMAT is very little compared to that
using RSA and FB OMAT.
IV. Conclusion
The technique proposed takes little time to encode and decode though the block length is high. The encoded
string will not generate any overhead bits. The block length may further increased beyond 256 bits, which may
enhance the security. Selecting the block pairs in random order, rather than taking those in consecutive order
may enhance security. The proposed scheme may be applicable to embedded systems.
V. Acknowledgement
The authors express their deep sense of gratitude to the Department of Information Technology, Siliguri
Institute of Technology,West Bengal University of Technology. The authors also express their deep sense of
gratitude to the Department of Computer Science & Engineering, Netaji Subhash Engineering college,West
Bengal University of Technology.
VI . Reference
Journal Paper:
[1] Rajdeep Chakraborty, Debajyoti Guha and J. K. Mandal, “A Block Cipher Based Cryptosystem Through Forward Backward
Overlapped Modulo Arithmetic Technique (FBOMAT)”, published in International Journal of Engineering & Science Research
Journal (IJESR), ISSN 2277 2685, accepted & published in Volume 2 – Issue 5 (May 2012) ,Article number 7,pp-349 – 360.
Emai rajdeep_chak@indiatimes.com, guha_debajyoti@yahoo.com, jkmandal@sancharnet.in,
Books:
[2] W. Stallings, Cryptography and Network Security: Principles and Practices, Prentice Hall, Upper Saddle River, New Jersey,
USA, Third Edition, 2003.
[3] Atul Kahate, Cryptography and Network Security, TMH, India,2nd
Ed,2009
[4] Behroz Forouzan, Cryptography and Network Security, TMH, India, 4th
Ed,2010
A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo
www.iosrjournals.org 146 | Page
Proceedings Paper:
[5] Mandal, J. K., Sinha, S., Chakraborty, R., " A Microprocessor-based BlockCipher through Overlapped Modulo Arithmetic
Technique (OMAT)",Proceedings of 12th International Conference of IEEE on Advanced Computing and Communications -
ADCOM-2004, December 15-18,Ahmedabad, India, pp. 276 - 280, 2004.

Contenu connexe

Tendances

A novel method for digital data encoding-decoding
A novel method for digital data encoding-decodingA novel method for digital data encoding-decoding
A novel method for digital data encoding-decodingTELKOMNIKA JOURNAL
 
A Survey on Various Lightweight Cryptographic Algorithms on FPGA
A Survey on Various Lightweight Cryptographic Algorithms on FPGAA Survey on Various Lightweight Cryptographic Algorithms on FPGA
A Survey on Various Lightweight Cryptographic Algorithms on FPGAIOSRJECE
 
Implementation of Designed Encoder and Decoder for Golay Code
Implementation of Designed Encoder and Decoder for Golay CodeImplementation of Designed Encoder and Decoder for Golay Code
Implementation of Designed Encoder and Decoder for Golay CodeIRJET Journal
 
Burrows wheeler based data compression and secure transmission
Burrows wheeler based data compression and secure transmissionBurrows wheeler based data compression and secure transmission
Burrows wheeler based data compression and secure transmissioneSAT Publishing House
 
An Efficient Design for Data Encryption and Decryption using Reconfigurable R...
An Efficient Design for Data Encryption and Decryption using Reconfigurable R...An Efficient Design for Data Encryption and Decryption using Reconfigurable R...
An Efficient Design for Data Encryption and Decryption using Reconfigurable R...IRJET Journal
 
A high speed tree-based 64-bit cmos binary comparator
A high speed tree-based 64-bit cmos binary comparatorA high speed tree-based 64-bit cmos binary comparator
A high speed tree-based 64-bit cmos binary comparatoreSAT Publishing House
 
Hash& mac algorithms
Hash& mac algorithmsHash& mac algorithms
Hash& mac algorithmsHarry Potter
 
Design and Implementation A different Architectures of mixcolumn in FPGA
Design and Implementation A different Architectures of mixcolumn in FPGADesign and Implementation A different Architectures of mixcolumn in FPGA
Design and Implementation A different Architectures of mixcolumn in FPGAVLSICS Design
 
Partial generation of 2n length walsh codes using n-bit gray and inverse gray c
Partial generation of 2n length walsh codes using n-bit gray and inverse gray cPartial generation of 2n length walsh codes using n-bit gray and inverse gray c
Partial generation of 2n length walsh codes using n-bit gray and inverse gray cIAEME Publication
 
Design and Implementation of High Speed Area Efficient Double Precision Float...
Design and Implementation of High Speed Area Efficient Double Precision Float...Design and Implementation of High Speed Area Efficient Double Precision Float...
Design and Implementation of High Speed Area Efficient Double Precision Float...IOSR Journals
 
Classless addressing
Classless addressingClassless addressing
Classless addressingIqra Abbas
 
Dr.naveen electronics binary codes
Dr.naveen electronics binary codesDr.naveen electronics binary codes
Dr.naveen electronics binary codesNAVEEN KUMAR
 
Enhancement of DES Algorithm with Multi State Logic
Enhancement of DES Algorithm with Multi State LogicEnhancement of DES Algorithm with Multi State Logic
Enhancement of DES Algorithm with Multi State LogicIJORCS
 
Subnetting Made Easy
Subnetting Made EasySubnetting Made Easy
Subnetting Made Easyheidionthego
 

Tendances (16)

A novel method for digital data encoding-decoding
A novel method for digital data encoding-decodingA novel method for digital data encoding-decoding
A novel method for digital data encoding-decoding
 
A Survey on Various Lightweight Cryptographic Algorithms on FPGA
A Survey on Various Lightweight Cryptographic Algorithms on FPGAA Survey on Various Lightweight Cryptographic Algorithms on FPGA
A Survey on Various Lightweight Cryptographic Algorithms on FPGA
 
Implementation of Designed Encoder and Decoder for Golay Code
Implementation of Designed Encoder and Decoder for Golay CodeImplementation of Designed Encoder and Decoder for Golay Code
Implementation of Designed Encoder and Decoder for Golay Code
 
Burrows wheeler based data compression and secure transmission
Burrows wheeler based data compression and secure transmissionBurrows wheeler based data compression and secure transmission
Burrows wheeler based data compression and secure transmission
 
An Efficient Design for Data Encryption and Decryption using Reconfigurable R...
An Efficient Design for Data Encryption and Decryption using Reconfigurable R...An Efficient Design for Data Encryption and Decryption using Reconfigurable R...
An Efficient Design for Data Encryption and Decryption using Reconfigurable R...
 
A high speed tree-based 64-bit cmos binary comparator
A high speed tree-based 64-bit cmos binary comparatorA high speed tree-based 64-bit cmos binary comparator
A high speed tree-based 64-bit cmos binary comparator
 
Hash& mac algorithms
Hash& mac algorithmsHash& mac algorithms
Hash& mac algorithms
 
Design and Implementation A different Architectures of mixcolumn in FPGA
Design and Implementation A different Architectures of mixcolumn in FPGADesign and Implementation A different Architectures of mixcolumn in FPGA
Design and Implementation A different Architectures of mixcolumn in FPGA
 
Partial generation of 2n length walsh codes using n-bit gray and inverse gray c
Partial generation of 2n length walsh codes using n-bit gray and inverse gray cPartial generation of 2n length walsh codes using n-bit gray and inverse gray c
Partial generation of 2n length walsh codes using n-bit gray and inverse gray c
 
Introduction to computer_lec_02
Introduction to computer_lec_02Introduction to computer_lec_02
Introduction to computer_lec_02
 
Design and Implementation of High Speed Area Efficient Double Precision Float...
Design and Implementation of High Speed Area Efficient Double Precision Float...Design and Implementation of High Speed Area Efficient Double Precision Float...
Design and Implementation of High Speed Area Efficient Double Precision Float...
 
Classless addressing
Classless addressingClassless addressing
Classless addressing
 
Dr.naveen electronics binary codes
Dr.naveen electronics binary codesDr.naveen electronics binary codes
Dr.naveen electronics binary codes
 
Enhancement of DES Algorithm with Multi State Logic
Enhancement of DES Algorithm with Multi State LogicEnhancement of DES Algorithm with Multi State Logic
Enhancement of DES Algorithm with Multi State Logic
 
Subnetting Made Easy
Subnetting Made EasySubnetting Made Easy
Subnetting Made Easy
 
Ch05
Ch05Ch05
Ch05
 

En vedette

Interference Aware & SINR Estimation in Femtocell Networks
Interference Aware & SINR Estimation in Femtocell NetworksInterference Aware & SINR Estimation in Femtocell Networks
Interference Aware & SINR Estimation in Femtocell NetworksIOSR Journals
 
An Efficient Algorithm for the Segmentation of Astronomical Images
An Efficient Algorithm for the Segmentation of Astronomical  ImagesAn Efficient Algorithm for the Segmentation of Astronomical  Images
An Efficient Algorithm for the Segmentation of Astronomical ImagesIOSR Journals
 
Cloud Information Accountability Frameworks for Data Sharing in Cloud
Cloud Information Accountability Frameworks for Data Sharing in CloudCloud Information Accountability Frameworks for Data Sharing in Cloud
Cloud Information Accountability Frameworks for Data Sharing in CloudIOSR Journals
 
An Overview of Steganography
An Overview of SteganographyAn Overview of Steganography
An Overview of SteganographyIOSR Journals
 
Implementation of Knowledge Based Authentication System Using Persuasive Cued...
Implementation of Knowledge Based Authentication System Using Persuasive Cued...Implementation of Knowledge Based Authentication System Using Persuasive Cued...
Implementation of Knowledge Based Authentication System Using Persuasive Cued...IOSR Journals
 
Using Aspect Ratio to Classify Red Blood Images
Using Aspect Ratio to Classify Red Blood ImagesUsing Aspect Ratio to Classify Red Blood Images
Using Aspect Ratio to Classify Red Blood ImagesIOSR Journals
 
A Challenge to Analyze and Detect Altered Human Fingerprints
A Challenge to Analyze and Detect Altered Human FingerprintsA Challenge to Analyze and Detect Altered Human Fingerprints
A Challenge to Analyze and Detect Altered Human FingerprintsIOSR Journals
 
Real Time Seismic Monitoring System for Earthquake Using GPS Technology
Real Time Seismic Monitoring System for Earthquake Using GPS TechnologyReal Time Seismic Monitoring System for Earthquake Using GPS Technology
Real Time Seismic Monitoring System for Earthquake Using GPS TechnologyIOSR Journals
 

En vedette (20)

Interference Aware & SINR Estimation in Femtocell Networks
Interference Aware & SINR Estimation in Femtocell NetworksInterference Aware & SINR Estimation in Femtocell Networks
Interference Aware & SINR Estimation in Femtocell Networks
 
An Efficient Algorithm for the Segmentation of Astronomical Images
An Efficient Algorithm for the Segmentation of Astronomical  ImagesAn Efficient Algorithm for the Segmentation of Astronomical  Images
An Efficient Algorithm for the Segmentation of Astronomical Images
 
J012446569
J012446569J012446569
J012446569
 
A1102020113
A1102020113A1102020113
A1102020113
 
H010514547
H010514547H010514547
H010514547
 
B011130918
B011130918B011130918
B011130918
 
G011115473
G011115473G011115473
G011115473
 
D0611923
D0611923D0611923
D0611923
 
P1232108115
P1232108115P1232108115
P1232108115
 
Cloud Information Accountability Frameworks for Data Sharing in Cloud
Cloud Information Accountability Frameworks for Data Sharing in CloudCloud Information Accountability Frameworks for Data Sharing in Cloud
Cloud Information Accountability Frameworks for Data Sharing in Cloud
 
S110304122142
S110304122142S110304122142
S110304122142
 
B012310410
B012310410B012310410
B012310410
 
An Overview of Steganography
An Overview of SteganographyAn Overview of Steganography
An Overview of Steganography
 
C010411722
C010411722C010411722
C010411722
 
Implementation of Knowledge Based Authentication System Using Persuasive Cued...
Implementation of Knowledge Based Authentication System Using Persuasive Cued...Implementation of Knowledge Based Authentication System Using Persuasive Cued...
Implementation of Knowledge Based Authentication System Using Persuasive Cued...
 
B0141020
B0141020B0141020
B0141020
 
B012651523
B012651523B012651523
B012651523
 
Using Aspect Ratio to Classify Red Blood Images
Using Aspect Ratio to Classify Red Blood ImagesUsing Aspect Ratio to Classify Red Blood Images
Using Aspect Ratio to Classify Red Blood Images
 
A Challenge to Analyze and Detect Altered Human Fingerprints
A Challenge to Analyze and Detect Altered Human FingerprintsA Challenge to Analyze and Detect Altered Human Fingerprints
A Challenge to Analyze and Detect Altered Human Fingerprints
 
Real Time Seismic Monitoring System for Earthquake Using GPS Technology
Real Time Seismic Monitoring System for Earthquake Using GPS TechnologyReal Time Seismic Monitoring System for Earthquake Using GPS Technology
Real Time Seismic Monitoring System for Earthquake Using GPS Technology
 

Similaire à A Block Cipher Based Cryptosystem through Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT)

An odd even block cipher based cryptosystem through modulo arithmatic techniq...
An odd even block cipher based cryptosystem through modulo arithmatic techniq...An odd even block cipher based cryptosystem through modulo arithmatic techniq...
An odd even block cipher based cryptosystem through modulo arithmatic techniq...eSAT Journals
 
An odd even block cipher based cryptosystem through
An odd even block cipher based cryptosystem throughAn odd even block cipher based cryptosystem through
An odd even block cipher based cryptosystem througheSAT Publishing House
 
A vlsi implementation of a resource efficient and secure architecture of a b...
A vlsi implementation of a resource efficient and secure architecture of  a b...A vlsi implementation of a resource efficient and secure architecture of  a b...
A vlsi implementation of a resource efficient and secure architecture of a b...eSAT Journals
 
A vlsi implementation of a resource efficient and secure architecture of a b...
A vlsi implementation of a resource efficient and secure architecture of  a b...A vlsi implementation of a resource efficient and secure architecture of  a b...
A vlsi implementation of a resource efficient and secure architecture of a b...eSAT Journals
 
An optimized encryption algorithm and F function with Dynamic substitution fo...
An optimized encryption algorithm and F function with Dynamic substitution fo...An optimized encryption algorithm and F function with Dynamic substitution fo...
An optimized encryption algorithm and F function with Dynamic substitution fo...CSITiaesprime
 
Modified Blowfish algorithm analysis using derivation cases
Modified Blowfish algorithm analysis using derivation casesModified Blowfish algorithm analysis using derivation cases
Modified Blowfish algorithm analysis using derivation casesjournalBEEI
 
Mcs 012 computer organisation and assemly language programming- ignou assignm...
Mcs 012 computer organisation and assemly language programming- ignou assignm...Mcs 012 computer organisation and assemly language programming- ignou assignm...
Mcs 012 computer organisation and assemly language programming- ignou assignm...Dr. Loganathan R
 
Hardware implementation of aes encryption and decryption for low area & power...
Hardware implementation of aes encryption and decryption for low area & power...Hardware implementation of aes encryption and decryption for low area & power...
Hardware implementation of aes encryption and decryption for low area & power...eSAT Publishing House
 
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. TechniqueDesign and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. TechniqueIJMER
 
Combating Bit Losses in Computer Networks using Modified Luby Transform Code
Combating Bit Losses in Computer Networks using Modified Luby Transform CodeCombating Bit Losses in Computer Networks using Modified Luby Transform Code
Combating Bit Losses in Computer Networks using Modified Luby Transform CodeIJMER
 
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. TechniqueDesign and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. TechniqueIJMER
 
Aes 128 192_256_bits_project_report
Aes 128 192_256_bits_project_reportAes 128 192_256_bits_project_report
Aes 128 192_256_bits_project_reportsakhi rehman
 
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...IJNSA Journal
 
A Novel Method of Generating (Stream Cipher) Keys for Secure Communication
A Novel Method of Generating (Stream Cipher) Keys for Secure CommunicationA Novel Method of Generating (Stream Cipher) Keys for Secure Communication
A Novel Method of Generating (Stream Cipher) Keys for Secure CommunicationIOSR Journals
 
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...IOSRJECE
 

Similaire à A Block Cipher Based Cryptosystem through Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT) (20)

An odd even block cipher based cryptosystem through modulo arithmatic techniq...
An odd even block cipher based cryptosystem through modulo arithmatic techniq...An odd even block cipher based cryptosystem through modulo arithmatic techniq...
An odd even block cipher based cryptosystem through modulo arithmatic techniq...
 
An odd even block cipher based cryptosystem through
An odd even block cipher based cryptosystem throughAn odd even block cipher based cryptosystem through
An odd even block cipher based cryptosystem through
 
A vlsi implementation of a resource efficient and secure architecture of a b...
A vlsi implementation of a resource efficient and secure architecture of  a b...A vlsi implementation of a resource efficient and secure architecture of  a b...
A vlsi implementation of a resource efficient and secure architecture of a b...
 
A vlsi implementation of a resource efficient and secure architecture of a b...
A vlsi implementation of a resource efficient and secure architecture of  a b...A vlsi implementation of a resource efficient and secure architecture of  a b...
A vlsi implementation of a resource efficient and secure architecture of a b...
 
An optimized encryption algorithm and F function with Dynamic substitution fo...
An optimized encryption algorithm and F function with Dynamic substitution fo...An optimized encryption algorithm and F function with Dynamic substitution fo...
An optimized encryption algorithm and F function with Dynamic substitution fo...
 
Modified Blowfish algorithm analysis using derivation cases
Modified Blowfish algorithm analysis using derivation casesModified Blowfish algorithm analysis using derivation cases
Modified Blowfish algorithm analysis using derivation cases
 
Mcs 012 computer organisation and assemly language programming- ignou assignm...
Mcs 012 computer organisation and assemly language programming- ignou assignm...Mcs 012 computer organisation and assemly language programming- ignou assignm...
Mcs 012 computer organisation and assemly language programming- ignou assignm...
 
Hardware implementation of aes encryption and decryption for low area & power...
Hardware implementation of aes encryption and decryption for low area & power...Hardware implementation of aes encryption and decryption for low area & power...
Hardware implementation of aes encryption and decryption for low area & power...
 
G364246
G364246G364246
G364246
 
Js2517181724
Js2517181724Js2517181724
Js2517181724
 
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. TechniqueDesign and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
 
Combating Bit Losses in Computer Networks using Modified Luby Transform Code
Combating Bit Losses in Computer Networks using Modified Luby Transform CodeCombating Bit Losses in Computer Networks using Modified Luby Transform Code
Combating Bit Losses in Computer Networks using Modified Luby Transform Code
 
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. TechniqueDesign and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
Design and Implementation of 8 Bit Multiplier Using M.G.D.I. Technique
 
Aes 128 192_256_bits_project_report
Aes 128 192_256_bits_project_reportAes 128 192_256_bits_project_report
Aes 128 192_256_bits_project_report
 
C0421013019
C0421013019C0421013019
C0421013019
 
IP Subnetting
IP SubnettingIP Subnetting
IP Subnetting
 
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...
 
A Novel Method of Generating (Stream Cipher) Keys for Secure Communication
A Novel Method of Generating (Stream Cipher) Keys for Secure CommunicationA Novel Method of Generating (Stream Cipher) Keys for Secure Communication
A Novel Method of Generating (Stream Cipher) Keys for Secure Communication
 
B017110713
B017110713B017110713
B017110713
 
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...
FPGA Based Implementation of AES Encryption and Decryption with Low Power Mul...
 

Plus de IOSR Journals (20)

A011140104
A011140104A011140104
A011140104
 
M0111397100
M0111397100M0111397100
M0111397100
 
L011138596
L011138596L011138596
L011138596
 
K011138084
K011138084K011138084
K011138084
 
J011137479
J011137479J011137479
J011137479
 
I011136673
I011136673I011136673
I011136673
 
G011134454
G011134454G011134454
G011134454
 
H011135565
H011135565H011135565
H011135565
 
F011134043
F011134043F011134043
F011134043
 
E011133639
E011133639E011133639
E011133639
 
D011132635
D011132635D011132635
D011132635
 
C011131925
C011131925C011131925
C011131925
 
A011130108
A011130108A011130108
A011130108
 
I011125160
I011125160I011125160
I011125160
 
H011124050
H011124050H011124050
H011124050
 
G011123539
G011123539G011123539
G011123539
 
F011123134
F011123134F011123134
F011123134
 
E011122530
E011122530E011122530
E011122530
 
D011121524
D011121524D011121524
D011121524
 
C011121114
C011121114C011121114
C011121114
 

Dernier

دليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratory
دليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratoryدليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratory
دليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide LaboratoryBahzad5
 
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....santhyamuthu1
 
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...amrabdallah9
 
Semiconductor Physics Background and Light Emitting Diode(LEDs)-.pptx
Semiconductor Physics Background and Light Emitting Diode(LEDs)-.pptxSemiconductor Physics Background and Light Emitting Diode(LEDs)-.pptx
Semiconductor Physics Background and Light Emitting Diode(LEDs)-.pptxbhoomijyani51
 
cloud computing notes for anna university syllabus
cloud computing notes for anna university syllabuscloud computing notes for anna university syllabus
cloud computing notes for anna university syllabusViolet Violet
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesDIPIKA83
 
Guardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSecGuardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSecTrupti Shiralkar, CISSP
 
EPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptxEPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptxJoseeMusabyimana
 
Modelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovationsModelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovationsYusuf Yıldız
 
Dev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & LoggingDev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & LoggingMarian Marinov
 
Phase noise transfer functions.pptx
Phase noise transfer      functions.pptxPhase noise transfer      functions.pptx
Phase noise transfer functions.pptxSaiGouthamSunkara
 
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfRenewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfodunowoeminence2019
 
nvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptxnvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptxjasonsedano2
 
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxIT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxSAJITHABANUS
 
Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...sahb78428
 
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...soginsider
 
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...Amil baba
 
Basic Principle of Electrochemical Sensor
Basic Principle of  Electrochemical SensorBasic Principle of  Electrochemical Sensor
Basic Principle of Electrochemical SensorTanvir Moin
 
Nodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptxNodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptxwendy cai
 

Dernier (20)

دليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratory
دليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratoryدليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratory
دليل تجارب الاسفلت المختبرية - Asphalt Experiments Guide Laboratory
 
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
 
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
 
Semiconductor Physics Background and Light Emitting Diode(LEDs)-.pptx
Semiconductor Physics Background and Light Emitting Diode(LEDs)-.pptxSemiconductor Physics Background and Light Emitting Diode(LEDs)-.pptx
Semiconductor Physics Background and Light Emitting Diode(LEDs)-.pptx
 
cloud computing notes for anna university syllabus
cloud computing notes for anna university syllabuscloud computing notes for anna university syllabus
cloud computing notes for anna university syllabus
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display Devices
 
Guardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSecGuardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSec
 
EPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptxEPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptx
 
Modelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovationsModelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovations
 
Litature Review: Research Paper work for Engineering
Litature Review: Research Paper work for EngineeringLitature Review: Research Paper work for Engineering
Litature Review: Research Paper work for Engineering
 
Dev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & LoggingDev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & Logging
 
Phase noise transfer functions.pptx
Phase noise transfer      functions.pptxPhase noise transfer      functions.pptx
Phase noise transfer functions.pptx
 
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfRenewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
 
nvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptxnvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptx
 
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxIT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
 
Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...
 
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
 
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
 
Basic Principle of Electrochemical Sensor
Basic Principle of  Electrochemical SensorBasic Principle of  Electrochemical Sensor
Basic Principle of Electrochemical Sensor
 
Nodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptxNodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptx
 

A Block Cipher Based Cryptosystem through Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT)

  • 1. IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 1 (Jul. - Aug. 2013), PP 138-146 www.iosrjournals.org www.iosrjournals.org 138 | Page A Block Cipher Based Cryptosystem through Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT) Debajyoti Guha1 , Rajdeep Chakraborty2 , Abhirup Sinha3 1 Dept. of IT, Siliguri Institute of Technology,Darjeeling-734009, West Bengal, India. 2 Dept of CSE, Netaji Subhash Engineering College, Garia , Kolkata-700152, West Bengal, India. 3 Tata Consultancy Services, New Town, Rajarhat, Kolkata-700156,West Bengal, India. Abstract: In this paper, a new Cryptosystem based on block cipher has been proposed where the encryption is done through Modified Forward Backward Overlapped Modulo Arithmetic Technique (MFBOMAT). The original message is considered as a stream of bits, which is then divided into a number of blocks, each containing n bits, where n is any one of 2, 4, 8, 16, 32, 64, 128, 256. The first and last blocks are then added where the modulus of addition is 2n . The result replaces the last block (say Nth block), first block remaining unchanged (Forward mode). In the next attempt the second and the Nth block (the changed block) are added and the result replaces the second block(Backward mode).Again the second (the changed block) and the (N-1)th block are added and the result replaces the (N-1)th block (Forward mode).The modulo addition has been implemented in a very simple manner where the carry out of the MSB is discarded to get the result. The technique is applied in a cascaded manner by varying the block size from 2 to 256. The whole technique has been implemented by using a modulo subtraction technique for decryption. Keywords: FBOMAT, Symmetric block cipher, Cryptosystem I. Introduction 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 be kept secret from others [2]. A very important reason to encode data or messages is to keep them secret. From e-mail to cellular communication, from secured web access to digital cash, cryptography [3] is an essential part of today’s information systems. It can prevent fraud in electronic commerce and assure the validity of financial transactions. It can prove one’s identity and protect one’s anonymity. These electronic commerce schemes may fall fraud through forgery, misrepresentation, denial of service and cheating if we do not add security to these systems. In fact, computerization makes the risks even greater by allowing attacks that are impossible in non- automated systems. Only strong cryptography can protect against these attacks. The Section I of this paper deals with the proposed scheme. A concept of key-generation is given in Section II. Results and comparisons are illustrated in Section III. Conclusions are drawn in Section IV, acknowledgements are shown in section V and Section VI lists the references. 1. The Modified Forward Backward Modulo Arithmetic Technique (MFBOMAT) In the proposed scheme the source file is input as streams of binary bits. For our implementation we have taken the stream size to be 512 bits though the scheme may be implemented for larger stream sizes also. The input stream, S, is first broken into a number of blocks, each containing n bits (n=2k , k=1,2,3,......,8) so that S = B1B2B3.......B m where m=512/n. Starting from the MSB, the blocks are paired as (B1,Bm), (B2,Bm), (B2,Bm-1),(B3,Bm-1) and so on. So there is a common member in any two non-adjacent block- pairs, i.e. the block-pairs are overlapping and hence the name given to the technique The FBOMAT operation is applied to each pair of blocks. The process is repeated, each time increasing the block size till n=256.The proposed scheme has been implemented by using the reverse technique, i.e. modulo subtraction technique, for decryption. Section 1.1 explains the operation in detail. 1.1. The Algorithm for MFBOMAT After breaking the input stream into blocks of 2 bits each and pairing the blocks as explained in Section 1, the following operations are performed starting from the most significant side: Round 1: In each pair of blocks, the first member of the pair is added to the second member where the modulus of addition is 2n for block size n. Therefore for 2-bit blocks, the modulus of addition will be 4. This round is
  • 2. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 139 | Page repeated for a finite number of times and the number of iterations will form a part of the session key as discussed in Section 3. Round 2: The same operation as in Round 1 is performed with block size 4. In this fashion several rounds are completed till we reach Round 8 where the block size is 256 and we get the encrypted bit-stream. The operations of the non adjacent block-pairs increases the complexity of the algorithm resulting in the enhancement of security. During decryption, the reverse operation, i.e. modulo subtraction, is performed instead of modulo addition, starting from the blocks B m/2 and ((B m) /2) +1 and then ((B m)/2) and ((B m) /2) +2 and then ((B m)/2)- 1 and ((B m) /2) +2 .The process continues until all the remaining blocks are decrypted. . 1.1. The Modulo Addition An alternative method for modulo addition is proposed here to make the calculations simple. The need for computation of decimal equivalents of the blocks is avoided here since we will get large decimal integer values for large binary blocks. The method proposed here is just to discard the carry out of the MSB after the addition to get the result. For example, if we add 1101 and 1001 we get 10110. In terms of decimal values, 13+9=22. Since the modulus of addition is 16 (24 ) in this case, the result of addition should be 6 (22-16=6). Discarding the carry from 10110 is equivalent to subtracting 10000 (i.e. 16 in decimal). So the result will be 0110, which is equivalent to 6 in decimal. The same is applicable to any block size. 1.2. Example of the Scheme Although the proposed scheme is applied to a 512-bit input stream, for the sake of brevity, consider a stream of 32 bits, say S = 1101001100011011 each round is performed only once to make the process simple for understanding. 1.2.1 The Encryption Scheme Round 1: Block size = 2, number of blocks = 8
  • 3. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 140 | Page Input (B2, B3) mod16, Change B3 Round 3: Block size = 8, number of blocks = 2 Input 11111010 00000101 B1 B2 Output 11111010 11111111 B1 B2 (B1, B2) mod 256, Change B2 Since we have considered only a 16-bit stream we cannot proceed further. The output from Round 3, say S', is the encrypted stream, i.e. S' =.1111101011111111.For decryption the opposite method i.e. modular subtraction is used to get back the original bit stream in S. 1.2.2 The Decryption Scheme For decryption the opposite method i.e. modular subtraction is used to get back the original bit stream in S. Round 1:Block size=8, number of blocks =2 Input 11111010 11111111 B1 B2 Output 11111010 00000101 B1 B2 (B1, B2) mod 256, Change B2 Round 2:Block size=4, number of blocks=4 Input 1111 1010 0000 0101 B1 B2 B3 B4 Output 1111 1010 0110 0101 B1 B2 B3 B4 (B2, B3) mod16, Change B3 Input 1111 1010 0110 0101 B1 B2 B3 B4 Output 1111 0101 0110 0101 B1 B2 B3 B4 (B2, B4) mod16, Change B2 Input 1111 0101 0110 0101 B1 B2 B3 B4 Output 1111 0101 0110 0110 B1 B2 B3 B4 (B1, B4) mod4, Change B4
  • 4. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 141 | Page Round 3:Block size=2, number of blocks =8 Input 11 11 01 01 01 10 01 10 B1 B2 B3 B4 B5 B6 B7 B8 Output 11 11 01 01 00 10 01 10 B1 B2 B3 B4 B5 B6 B7 B8 (B4, B5) mod4, Change B5 Input 11 11 01 01 00 10 01 10 B1 B2 B3 B4 B5 B6 B7 B8 Output 11 11 01 11 00 10 01 10 B1 B2 B3 B4 B5 B6 B7 B8 (B4, B6) mod4, Change B4 Input 11 11 01 11 00 10 01 10 B1 B2 B3 B4 B5 B6 B7 B8 11 11 01 11 00 01 01 10 B1 B2 B3 B4 B5 B6 B7 B8 (B3, B6) mod4, Change B6 Input 11 11 01 11 00 01 01 10 B1 B2 B3 B4 B5 B6 B7 B8 Output 11 11 00 11 00 01 01 10 B1 B2 B3 B4 B5 B6 B7 B8 (B3, B7) mod4, Change B3 Input 11 11 00 11 00 01 01 10 B1 B2 B3 B4 B5 B6 B7 B8 Output 11 11 00 11 00 01 10 10 B1 B2 B3 B4 B5 B6 B7 B8 (B2, B7) mod4, Change B7 Input 11 11 00 11 00 01 10 10 B1 B2 B3 B4 B5 B6 B7 B8 Output 11 01 00 11 00 01 10 10 B1 B2 B3 B4 B5 B6 B7 B8 (B2, B8) mod4, Change B2 Input 11 01 00 11 00 01 10 10 B1 B2 B3 B4 B5 B6 B7 B8 Output 11 01 00 11 00 01 10 11 B1 B2 B3 B4 B5 B6 B7 B8 (B1, B8) mod4, Change B8 The decrypted bit stream :S”=1101001100011011.So S=S”.
  • 5. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 142 | Page II. Key Generation In the proposed scheme, eight rounds have been considered, each for 2, 4, 8, 16, 32, 64, 128, and 256 block size. As mentioned in Section 2.1, each round is repeated for a finite number of times and the number of iterations will form a part of the encryption-key. Although the key may be formed in many ways, for the sake of brevity it is proposed to represent the number of iterations in each round by a 16-bit binary string. The binary strings are then concatenated to form a 128-bit key for a particular key. Example in Section 3.1 illustrates the key generation process. 2.1. Example of Key Generation Consider a particular session where the source file is encrypted using iterations for block sizes 2, 4, 8, 16, 32, 64, 128, and 256 bits, respectively. Table 1 shows the corresponding binary value for the number of iterations in Table 1 : Representation of no. of iterations in each round by bits. Round No. Block Size No. of Iterations Decimal Binary 1 2 74 0000000001001010 2 4 680 0000001010101000 3 8 4278 0001000010110110 4 16 44428 1010110110001100 5 32 44443 1010110110011011 6 64 48878 1011111011101110 7 128 49870 1100001011001110 8 256 50020 1100001101100100 Each round. The binary strings are concatenated together to form the 128-bit binary string : 000000000100101000000010101010000001000010110110101011011000110010101101100110111011111011 10111011000010110011101100001101100100.. This 128-bit binary string will be the encryption-key for this particular session. During decryption, the same key is taken to iterate each round of modulo-subtraction for the specified number of times. III. Results and Comparisons The variation of frequencies of all the 256 ASCII characters between the source file and the encrypted file are given in this section. The evenly distribution of character frequency over the 0-255 region of the encrypted file Fig. 1 : Frequency Distribution of ASCII characters in the source files.
  • 6. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 143 | Page Fig. 2 : Frequency Distribution of ASCII characters MFBOMAT encrypted files Against the source file ensures better security provided by the proposed algorithm and it also shows the heterogeneity between the two files. The frequency distribution graph is drawn according to the percentage of occurrence of a particular character, not the total number of occurrence. Fig. 3 : Frequency Distribution of ASCII characters in the RSA encrypted file. Fig. 4 : Frequency Distribution of ASCII characters in the FBOMAT encrypted file. Although ten different text files were encrypted and decrypted using both RSA and MFBOMAT, only one such file is considered here for analyzing the results. Figs. 1, 2,3and 4 illustrate the frequencies of occurrence of all the 256 ASCII characters in the source file, encrypted file with MFBOMAT, and encrypted file with RSA and FBOMAT. A close observation will reveal that the characters in the encrypted file using MFBOMAT are fairly well distributed throughout the character space. Hence the MFBOMAT scheme may be comparable with RSA and FBOMAT. Another way to analyze the scheme is to test the homogeneity of the source and the encrypted file. The Chi-Square test has been performed for this purpose. Table 2 and fig 5 shows the source file name, size and the corresponding Chi-Square values (using MFBOMAT, RSA, FBOMAT) for ten different files. Barring some exceptions we see that the Chi-Square value increases with the increase in file size. Further, the high values prove that Chi-Square is highly significant at 1% level of significance.
  • 7. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 144 | Page Table 2 : Test for homogeneity using Chi-Square method. Fig. 5 : Graph showing Chi-Square values for MFBOMAT, FBOMAT and RSA Hence the source and the corresponding encrypted files are considered to be heterogeneous. Another way to analyze the scheme is to analysis the encryption and decryption time. Table 3: indicates encryption time for MFBOMAT, FBOMAT and RSA Fig 6: shows graphically Time Complexity Analysis among MFBOMAT, FBOMAT & RSA for Encryption.
  • 8. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 145 | Page Table 4: indicates decryption time for MFBOMAT, FBOMAT and RSA Fig 7: shows graphically Time Complexity Analysis among MFBOMAT, FBOMAT and RSA for Decryption It can be seen that the time taken to encrypt a file using MFBOMAT is very little compared to that using RSA and FB OMAT. IV. Conclusion The technique proposed takes little time to encode and decode though the block length is high. The encoded string will not generate any overhead bits. The block length may further increased beyond 256 bits, which may enhance the security. Selecting the block pairs in random order, rather than taking those in consecutive order may enhance security. The proposed scheme may be applicable to embedded systems. V. Acknowledgement The authors express their deep sense of gratitude to the Department of Information Technology, Siliguri Institute of Technology,West Bengal University of Technology. The authors also express their deep sense of gratitude to the Department of Computer Science & Engineering, Netaji Subhash Engineering college,West Bengal University of Technology. VI . Reference Journal Paper: [1] Rajdeep Chakraborty, Debajyoti Guha and J. K. Mandal, “A Block Cipher Based Cryptosystem Through Forward Backward Overlapped Modulo Arithmetic Technique (FBOMAT)”, published in International Journal of Engineering & Science Research Journal (IJESR), ISSN 2277 2685, accepted & published in Volume 2 – Issue 5 (May 2012) ,Article number 7,pp-349 – 360. Emai rajdeep_chak@indiatimes.com, guha_debajyoti@yahoo.com, jkmandal@sancharnet.in, Books: [2] W. Stallings, Cryptography and Network Security: Principles and Practices, Prentice Hall, Upper Saddle River, New Jersey, USA, Third Edition, 2003. [3] Atul Kahate, Cryptography and Network Security, TMH, India,2nd Ed,2009 [4] Behroz Forouzan, Cryptography and Network Security, TMH, India, 4th Ed,2010
  • 9. A Block Cipher Based Cryptosystem Through Modified Forward Backward Overlapped Modulo www.iosrjournals.org 146 | Page Proceedings Paper: [5] Mandal, J. K., Sinha, S., Chakraborty, R., " A Microprocessor-based BlockCipher through Overlapped Modulo Arithmetic Technique (OMAT)",Proceedings of 12th International Conference of IEEE on Advanced Computing and Communications - ADCOM-2004, December 15-18,Ahmedabad, India, pp. 276 - 280, 2004.