INFORMATION SECURITY USING MODULATION TECHNIQUE

In the present work we have introduced a new cryptographic method, called algorithm SKG 3.11, for encryption and decryption of any text file at five stages (1) First, by converting each character into corresponding binary form using 8-bit ASCII Code thus we get 8N bits for a text of N characters (2) Secondly, by swapping the integral multiple of leftmost N1st bit with corresponding N1st rightmost bit till 4Nth bit if remainder of (8N+1/N1) is zero otherwise upto 8Nth bit (3) Thirdly, creating a binary string of 0’s and 1’s such that total number of 0’s and 1’s is 8N, the consecutive numbers of 0’s and 1’s in this string may be from 1 to 7 (4) Fourthly, using C-NOT Gate on binary strings obtained at stages two and three and (5) Finally, converting binary string obtained at stage four into corresponding characters using 8-bit ASCII Code. This algorithm can be applied to any text consisting of 10 or more characters. The results obtained after application of this algorithm are excellent and difficult to decrypt.