Major Breakthrough in Crytography using Random nos.

[RAGU <synlog@vsnl.com>]

    [ Part 1, Text/PLAIN (charset: ISO-8859-1 "Latin 1")  137 lines. ]
    [ Unable to print this part. ]

    [ The following text is in the "iso-8859-1" character set. ]
    [ Your display is set for the "US-ASCII" character set.  ]
    [ Some characters may be displayed incorrectly. ]

Law of Random number's sequence
===============================
The nth output of the same random generator program is always same if the
initial seed and other constants of the the program are equal.
 
Conclusions of implementing in cryptography
===========================================
More efficient and much cheaper than OTP (One Time Pad) .
Doesn't need true random numbers at all
Can be easily designed at user's options
It's a slight modification of Vernam's principle and it's slightly away
from Shanon's theory.
Really fools brute seacrch attacks
Reveals the hidden Intelligence  in messages
 
Abstract:
=========
 
Instead of assingning  the different random nos. to characters
permanently and using complex algorithms,this program initially assigns
random nos. to keyboard strokes and it never reproduces these  assigned
values in the cipher text.
 

For encoding each character,it  changes the initialisation
parameter(seed) of random no. generator in a common way and finds  when
the assigned value of that character comes in that random no. generator's
output and this is encoded as the value of that character.
 
For decoding each character,it produces a sequence of random numbers in
the same way and using the cipher which gives  the location of assigned
value corresponding to the character in the random no. p; reproduces the
message.
 

Simple Encryption Algorithm
============================
The random generator program is initialised with a key(seed)and
samples for keyboard strokes are taken at equal intervals 'k'.
This 'k' is the  key ,say key k= 7175
 
ie, Every 'k' th output of the random generator is assingned to
the 86 characters of the keyboard.
 
say, the character 'R' is assigned to 34994333434658909
      the character 'i' is assigned to 43489823546898453
       the character 's' is assigned to 55985843000773483
       the character 'h' is assigned to 98636383983736387
  
 
Let us assume the first word in the message file is "Rishi".
 
The first character of the message file is read.ie. 'R'
 
we know R= 34994333434658909
 
The  key i.e. the initial seed is updated by one for the first
character,now key k=7176
 
Using this new seed (ie.  key + 1 ) ,random numbers are generated. The
encrption program checks every output of this new sequence of randoms no.
until the first character value of the message
file is encountered.
 
Say 34994333434658909 value comes as 930239 th output , which is the
cipher value for 'R' .
 
The seed  is again updated by one for the second character and second
sequence of random nos. is created.Now key =7177
 
The encryption program checks when the value of i (=43489823546898453)
is encountered.
 
say,if the 6383 rd ouput is 43489823546898453, then i= 6383,
 
No other 'i'  in the message file will be assigned to this no.,who
knows what key generates what no. at which interval.
 
For every  character in the message file , the seed to create random nos.
is updated and the encrption program looks when the value of the
for the character comes in the sequence and it is assigned as the
value for that character.
 
say ,when key = 7178 , s=55985843000773483 comes as 987432 nd output
      when key = 7179 , h=98636383983736387 comes as 748 th output
       when key = 7180 , i=43489823546898453 comes as 92 nd ouput
 
Note the values of 'i'
 
 so the word "Rishi" becomes 930239 6383 987432 748   92
                                               R         i      s        
h    i
 
Even if message contains 100 "Rishi", No body will able to able to guess
the message ,if proper constants and mod values are chosen for
generating random numbers .
 
Simple Decryption Algorithm
============================
Using initial seed ( key) and sampling interval 'k' ,
random nos. are generated and characters are assigned to it.
Same relation is obtained as the encoder .
 
Here also ,R = 34994333434658909
 
For decoding the first character in the cipher,the key is updated by one
and 930239 th output of the random no. generator is taken which
is equal to 34994333434658909 =R.
 
For decoding the second character in the cipher,the key is updated by one
and 6383 th output of the random no. generator is taken which
is equal to 34994333434658909 =R
 
For each  characters, the key is updated by one to generate different
sequence of random nos. to get same of what we got in the encrytion
algorithm  and using the cipher text , the corresponding outputs of
random nos. are taken and decoded  in to characters using the initial
assigned values.
 

Comments and Objections are WELCOME
======================================================================
 

 
Krishnamoorthi Ragunandhan
Systems Administrator
Synergy Log-In Systems Ltd STP
6 flr, ALSA Towers
187,PH rd
chennai
tamil nadu
India
phone:0091-44-5324169/70/90
email id: trickysalamander@yahoo.com