Patent ID: 11917047
Assignee: nan
Field: Digital communication (Electrical engineering)
Classification: CPC G  H | IPC H

Claim 9:
10. The method of claim 1, further comprising:
where the Elusive Key (Rock) is built by:
(a) using an arbitrary Snail sequence of the planned k bins with each bin marked by one letter out of the n letters of the plaintext language P, to be letter-marked, then arbitrarily selecting the number e of ‘empty bins’ to be mixed with the non-empty bins of the key, then arbitrarily selecting the number d of bins to be marked as ‘decoy’ bins, bins that don't contain any letter of P and are not empty bins; then arbitrarily selecting the number s of bins to be marked as ‘signal’ bins, bins that don't contain any letter of P, are not ‘decoy’, and are not empty bins,
utilizing a randomness source for each bin in the Snail sequence to decide for each bin whether it will be empty, decoy, signal or letter-marked, by running the randomness source so that the chance for each bin to be letter marked will be (k−i)/(k−i+e−j+d−l+s−r), the chance for each bin to be empty will be (e−j)/(k−i+e−j+d−l+s−r), the chance for each bin to be decoy will be (d−k)/)/(k−i+e−j+d−l+s−r), and the chance for each bin to be ‘signal’ will be (s−r)/)/(k−i+e−j+d−l+s−r), where i is the number of bins already selected to be letter-marked, j is the number of bins already selected to be empty, l is the number of bins already selected to be decoy, and r is the number of bins already selected to be signal, continuing with this randomization process for i=0, 1, . . . k, j=0, 1,2 . . . e, l=0,1, . . . d, r=0,1,2, . . . s; and
(b) utilizing a randomness source to assign a plaintext letter to each bin that was selected to be non-empty by:
(b).1 for each of the n letters of plaintext P selecting an arbitrary number of occurrences in the key: q1, q2, . . . qn such that q1+q2+ . . . +qn=k,
(b).2 for each non-empty bin by order use the randomness source so that the chance for each current bin to be assigned letter pj will be: Prj=(qi−gi)/(k−h) where gi is the number of bins that were assigned to be marked by letter pi, and h is the total number of bins that were assigned a letter before the current bin.