. . . "using the A to Z helix transformation function, wherein the A to Z helix transformation function comprises: ( W ) = ??? k = 0 l { ( ?? l - k ) n l - k + ( l - k ) } wherein W is a unique number obtained for a word having a length of l+1 letters, wherein the letters in the word W can be represented as ??l ??(l???1) ??(l???2) . . . ??0, and also wherein ??i represents the letter in the ith location" .