A Fast And Efficient Mixed Encryption Scheme Computer Science Essay

Management Information Systems ( MIS ) need to cover with sensitive informations really often. The bing Algorithms like DES, AES, RSA although extremely secure could n’t conceal their complexnesss when coming to advanced linguistic communication MIS tools. So we propose a assorted encoding strategy that involves a fast and efficient cryptanalytic hash map ( FSHA ) along with the SHOR transmutation strategy that serves non merely cheaper but besides faster manner to supply security in MIS.

1 Introduction

A direction information system ( MIS ) is a system or procedure that provides information needed to pull off organisations efficaciously [ 7 ] . Management information systems are regarded to be a subset of the overall internal controls processs in a concern, which cover the application of people, paperss, engineerings, and processs used by direction comptrollers to work out concern jobs such as bing a merchandise, service or a business-wide scheme [ 7 ] . Management information systems are distinguishable from regular information systems in that they are used to analyse other information systems applied in operational activities in the organisation [ 7 ] . The nucleus of informations encoding engineering is the encoding algorithm. Harmonizing to differences of keys in encoding algorithm, we can split encoding engineering into two systems, viz. the symmetric cryptanalytic system and non-symmetric cryptanalytic system. The feature of symmetric cryptanalytic system is that the keys of encoding and decoding are the same and AES ( Advanced Encryption Standard ) encoding algorithm is the typical representative.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

The feature of non-symmetric cryptanalytic system is that the keys of encoding and decoding are different. RSA algorithm is its typical representative. At present, the encoding strategy adopted by most MIS coders is sort of algorithms which unifies these two systems and signifiers “ the mix encoding algorithm ” . The normally used MIS development tools like VB, PB, VF and so on belong to advanced linguistic communication. However, the encoding algorithm codification to recognize AES and RSA is so complex, the operating velocity is slow and the system cost on transporting the algorithm is excessively expensive, particularly its displacement operation codification. So it ‘s hard to recognize it with advanced linguistic communication. So we propose a assorted encoding strategy affecting a new cryptanalytic hash map viz. Fast and Secure Hash Algorithm ( FSHA ) and the SHOR transmutation strategy, that is both light-weight and secure. The FSHA is fundamentally used for hallmark intents and further sensitive informations exchange is done utilizing SHOR transmutation.

2 Related Work

Tonss of research has been traveling on in countries refering to cryptography and security in Management Information Systems. [ 1 ] suggests a manner to implement less-overhead security in MIS utilizing MD5 and XOR-transformation ; while [ 2 ] suggests an new hash map viz. THA ( Tent-Map Based Hash Algorithm ) . [ 3 ] suggests a helter-skelter cryptanalytic hash map strategy. [ 4 ] develops optimum discrepancies of Hash Functions utilizing helter-skelter theory.

3 FSHA Hash Function

Hash maps are fundamentally easy to calculate digital fingerprints of informations. They are omnipresent in today ‘s IT systems and some of their common applications include digital signatures, hallmark, pseudo-random figure generators, message-authentication codifications etc. Our algorithm produces a 160-bit hash codification for the informations.

In our algorithm, we adopt a fresh message widening strategy. First 10 times recursive enlargement is conducted through round displacement and add-on modulo manners. This is done to heighten the relevance between each spot of the 512-bit block.

Assuming ‘M ‘ as the message and Xi is the ith word in the message, the message widening strategy is as follows:

Crosstalk = Mt ; 0 & lt ; =t & lt ; =15

Xt = Xt-3+Xt-8+Xt-14+Xt-16+ ( Xt-1+ Xt-2 +Xt-15 ) & lt ; & lt ; & lt ; 13 + ( Xt-1+ Xt-4 + Xt-11 ) & lt ; & lt ; & lt ; 23 ;

( 16 & lt ; =t & lt ; =25 )

Xt=Xt-1 + Xt-2 + Xt-9 + Xt-16 ; 26 & lt ; =t & lt ; =80

The algorithm to calculate FSHA is as follows:

1 ) Pad the message with a “ 1 ” followed by K nothings so that the overall length of the message becomes congruous modulo to 448 modulo 512.

2 ) Parse the message block Mi into 16 32-bit blocks: M0aˆ¦M15.

3 ) Five 32-bit Initial Hash Valuess:

U0=0x02468123 ; U1=0xfedcba89 ; U2=0xghij857 ;

U3=0xba465798 ; U4=0x02648cae.

4 ) Five 32-bit initial changeless parametric quantities:

V0=0x8475ghei ; V1=0x6edgebal ; V2=0x8f1bbcdc

V3=0xca62c1d6 ; V4=0x5793c62a.

5 ) Message-Widening strategy is adopted to obtain 80 word blocks.

6 ) Adopt the undermentioned process for bring forthing hash value:

I ) p0=U0 ; p1=U1 ; p2=U2 ; p3=U3 ; p4=U4

two ) for j=0 to 12

m=j*5 +16 ;

for i=0 to 4

Zi = ( ( ( pi + ( – ( pi & gt ; & gt ; 31 ) ) & lt ; & lt ; 1 ) OR ( ! ( pi & gt ; & gt ; 31 ) ) ) + Xi-m

For i=0 to 4

pi = Zi + ( ( Zi-1 mod 5+ Zi+2 mod 5 ) & lt ; & lt ; & lt ; 21 ) + ( ( Z i+1 mod 5 + Z i+3 mod 5 ) & lt ; & lt ; & lt ; 11 ) + V I

three ) p0+=U0 ; p1+=U1 ; p2+=U2 ; p3+=U3 ; p4+=U4

four ) Repeat stairss ( two ) and ( three ) boulder clay last block.

V ) The ensuing 160-bit message digest is p0 || p1 || p2 || p3 || p4. ( ‘|| ‘ bases for concatenation )

Note that ‘+ ‘ bases for modulo-2 add-on.

4 SHOR Transformation

The SHOR Transformation ( symmetric encoding ) strategy incorporates the undermentioned methodological analysis:

Encoding:

I ) First obtain a secret key utilizing Vigenere cypher[ 1 ]method with apparent text and a permuted signifier of a field text.

two ) For each character in the field text bash:

a ) Obtain the binary value of the character ( ASCII equivalent ) and so left rotate by 23 spots.

B ) Obtain the double star of the corresponding cardinal character ( ASCII equivalent ) and right rotate by 13 spots.

degree Celsius ) Take XOR of the values obtained in the above stairss.

vitamin D ) Now divide the consequence in above measure with the cardinal character to obtain a quotient and balance. Append the quotient to the forepart followed by the balance and convey the cypher text character.

Decoding:

a ) Extract the quotient and balances from the cypher text character.

B ) Multiply the quotient with the cardinal character and add with the balance to obtain a spot pattern.

degree Celsius ) Left revolve the key by 13 spots and XOR with the consequence obtained in ( B ) .

vitamin D ) Now right rotate the spot pattern by 23 spots to obtain the needed field text character.

vitamin E ) Repeat stairss ( a ) to ( vitamin D ) for every character and add on all the characters to obtain the necessary field text.

5 Performance Analysis

The public presentation analysis of FSHA hash algorithm is studied foremost. The parametric quantities considered are the avalanche consequence and calculation velocity.

Figure 1 compares the avalanche consequence belongings of SHA-1 and FSHA.

Fig. 1. A graphical comparing of the avalanche consequence in FSHA and SHA-1 algorithms

Avalanche consequence is the desirable belongings of cryptanalytic algorithms. It refers to amount ( in figure of spots ) of alteration in cypher text due to alter in a individual spot of field text. Greater the alteration, better is the algorithm.

Figure 2 compares the velocity of FSHA versus the velocities of popular Hashing algorithms like SHA-1, MD5 etc. and its proven that FSHA is much faster than them in both block sizes of 2048 and 240. As we know computation velocity is reciprocally relative to the algorithm complexness. Since complexness is less in FSHA compared to SHA-1 and MD5, it achieves greater velocity.

Fig. 2. Comparison of velocities of popular hashing algorithms versus FSHA algorithm

Fig. 3 compares the cardinal sizes of the assorted cryptanalytic algorithms. Although the cardinal size of our encoding algorithm is the least it does supply sufficient security for MIS because of the hallmark security provided by FSHA.

Fig. 3. Key sizes of assorted cryptanalytic algorithms versus the SHOR transmutation.

6 Conclusion and Future Work

Therefore a assorted encoding strategy dwelling of FSHA and SHOR offers a light weight and yet, a much secure manner in MIS. Future works include widening the SHOR by increasing the key size by add oning every bit much figure of nothings till it becomes modulo 512 and so executing different sorts of substitutions etc.