Patent Publication Number: US-2023138446-A1

Title: Replica: An Improved Communication Concealment Cipher

Description:
OVERVIEW 
     This application builds on the continued application Ser. No. 16/687,690, “Effective Concealment of Communication Pattern (BitGrey, BitLoop)” presenting a cipher that can readily distinguish between ciphertext bits and non-ciphertexts bits, even if mixed together. This “decoy tolerance” attribute makes it a good cipher to deploy with the BitGrey and BitLoop protocols. The Replica is based on a bit operation where a feed bit string F is used to replicate a template bit string T, by copying from F bits according to the template T. If T is replicated when F was traversed exactly to its end, then T and F are said to be in a balanced template match. Such match will point F to T, so that if T is taken to represent a letter in an alphabet, then F will point to it. And since F can be constructed to be very much longer than T, it so happens that one builds a large as desired ciphertext to send a given size message. This allows one to transmit a fixed rate output string while hiding how much, if any, real communication took place. The Replica cipher is highly randomized, compelling its attacker to be limited to brute force attack, and moreover, it hides not only the contents of the communication but also its pattern. This is a big advantage over mainstay ciphers that reveal to their examiner the extent the frequency and the duration of an attacked conversation. 
    
    
     BRIEF EXPLANATION OF DRAWINGS 
       FIG.  1   : REPLICA Box configuration 
     This figure shows the stand alone Replica box which is connected by wire to the secure computer (S-comp), and by wire or wireless to the networked computer (n-comp), and the box is shown to have optionally an independent communication element to directly send and receive messages through the Cloud. The Replica box is shown connected to an external randomness source. It shown to have a battery, an on/off switch and a port to fit in a large capacity SD device containing the Replica key. The drawing also shows a data storage element and a computing element. 
       FIG.  2   : Replica Pattern Concealment Configuration 
     This figure shows two communicating parties Alice and Bob, each having a Replica box connected each to an s-comp and an n-comp. Alice and Bob are sending each other a fixed rate of randomized bits. An outside observer will not know whether this stream is all randomized meaningless bits or some of them are bona fide messages between Alice and Bob. 
       FIG.  3    A Replica Pattern Concealing Conversation 
     This figure shows Alice and Bob streaming a constant bit rate to each other and lacing these randomized bits with meaningful messages. At some point Bob sends Alice message 1, Alice after some time replies with message 2, Bob replies to it with message 3 and so on for messages 4 and 5. This conversation is totally hidden for the outside observer who sees only a fixed bit flow of randomized looking bits. 
    
    
     INTRODUCTION 
     We first describe the mathematical operation of the Replica cipher, then discuss its cryptographic applications. 
     Given an alphabet A comprising 1 letters a 1 , a 2 , . . . a l , a string Q is defined as a concatenation of q letters from A, where r may be finite, or q→∞. 
     Let T, “Template” be a string of letters from A comprising t letters. Let F, “Feed” be a string of letters from A comprising f letters. 
     Replication (Basic Mode—Bitwise) 
     We define a process called ‘replication’ (R, or Rep). The general idea is to use the template string T as a template to replicate itself by taking letters from the feed string F, to build a copy of T. The feed string F with f letters, supplies t letters to replicate T (which is comprising t letters), and the balance d=f−t is discarded. Replication may be an imbalanced match between T and F, a balanced match between T and F, or a perfect match between T and F. The precise definition of the Rep operation is as follows: 
     The replicator function, REP, is guided by the template T, and is removing bits from the feed string F. It starts with letter t 1 , the first letter in T (t 1 ∈A). The replicator function then scans F from the first letter f 1  and up through f 2 , f 3 , . . . f i  where i=1, 2, . . . f. If string F does not contain the letter t 1 , the replicator returns ‘failed’. This is regarded as “zero match” situation. 
     Alternatively the replicator encounters letter f 1  in F (1≤i≤f), such that f i =t 1 . The replicator then removes letter f i  from F and places it in the first cell in a register of size t letters. The replicator then reads letter t 2  (t 2 ∈A), and searches for this letter t 2  from letter f i+1  and up to letter f f . If this search fails, then the replication stops, and a ‘failed’ status is issued. The register, containing only one letter t 1  is identified as a ‘short template’, the other f−1 letters from F form a discarded string D. 
     If this search is successful and the replicator finds letter f k  in F (k&gt;i) such that f k =t 2 , then f k  is moved to the 2nd spot in the register where the replica of T is being built, and the replicator then reads the third letter in T, t 3 . 
     The processes repeats: the replicator looks for a letter t 3  in the F string from letter f k+1  to letter f f . If the search fails then the string in the register, comprising 2 letters is submitted as output declared ‘short replica’ and the f−2 letters in F in order, form a string D of discarded bits. The replica operation is designated ‘failed’. 
     This process repeats until one of the following two events occur: 
     1. The replication is complete, the register contains a copy of T
 
2. A search for a letter in T fails, as described above, before the replication is complete
 
     In the 2nd case the replication is considered ‘failed’. In the 1st case, we further identify the following cases: (i) The replication is completed by passing the last letter in F, f f  to the register in position t, namely f f =t t . This is called a balanced match. 
     If that condition is not fulfilled then it is an imbalanced match. 
     The discarded bits by their order in F comprise a discarded list, D. This list is also called the ‘decoy list’, and its bits are the decoy bits. 
     The letters assembling in the register to where some F letters are routes, defines a replicated template, T*. T* will have t* letters when F has been done processing through its f letters. If t=t* then the replication occurred (balanced or imbalanced). If t*&lt;t then the replication has failed, because only part of the template has been reconstructed from the letters in F. 
     d letters of F are discarded (cancelled) in the duplication process: d=f−t* 
     We define a distance S between T and F: δ=δ(F,T)=f/t*−1 
     Note: the description above states that the last letter in the feed F will be the last letter in the template guided register for a balanced match. However, this can be modified to state that the last letter in the register will be the letter one, two, or more, before last in the Feed. 
     Analysis of the Replication Process 
     Clearly if T=F, then f=t=t* and the distance δ(F,T)=f/t*−1=0. where t* is the number of letters accumulated in the register before the replication failed, or succeeded. 
     If F has sufficient letters to replicate the template T, then T*=T. That is only if the letters in T appear in F in the same order (not a permutation thereto). 
     Illustration: let F=‘ABCD’, and T=‘BDAC’. The first letter in T is B. The first letter in F is A, so A is discarded (starts the discarded list). The second letter in F is B so B goes to the register for the starting spot. The second letter in T is D, but the third letter in F is C which is discarded (the discarded list is now AC). The 4th letter if F is D, so this D goes to the register. That is it, no more letters in F, so the replication algorithm is done. Resulting in an incomplete register T*=BD, and a discarded string D=AC. 
     However, if F=BCCSDCCABBC then relative to the same template:    
         F =BCCSDCCABBC,   A   →BDAC= T  
 
     and the distance d(F,T)=11/4−1=1.75 
     Lemma: If F{circumflex over ( )} is a random series of letters from A of an indefinite length, then for any T there will be a value f, such that the string comprised of the first f letters, in F{circumflex over ( )}, namely string F will have a balanced match with T. 
     Proof: any letter t i  in T will have a chance p=1/l&gt;0 to be the next letter in F{circumflex over ( )}, such that after sufficient instances of discarding letters in F{circumflex over ( )}, the required letter t i  will appear. 
     Lemma: The above lemma is correct even if F{circumflex over ( )} is not perfectly randomized, as long as the chance to appear in F{circumflex over ( )} for any letter a i  of alphanet A is somewhat above zero. 
     If T is a random string in alphabet A, then one would compute the length f of a random series F that is most likely to build a balanced replication match with T. To the extent that a source of randomness builds a feed string F′ where the size f is much different from f, then either F′ or T are not very random. This may serve as a basis for measuring randomness. 
     We examine the relationship δ=δ(F,T). δ computes very easy and the answer is definite and unequivocated. However both reverse options are seriously equivocated. 
     Two Ways Many to One 
     We say Y=REP(X), (REP stands for the replica algorithm described above) if X as a feed and Y as a template establish a balanced match. The REP algorithm therefore is generating a balanced matching Y for a given X. We say X=REPR(Y) (REPR stands for reverse-Replica) if X as a feed and Y as a template establish a balanced match. 
     REPR is also denoted as “The Replica Builder”, it builds a proper feed for a given template. 
     We have seen above that it is very easy and straight forward to build feeds from templates. 
     In other words the Replica Builder can be applied again and again with different results each time. Since there is no limit to the number of decoy letters to be added to the template, there is also no limit to how many feeds can be matched with a given template. In other words Y→X is a one-to-many relationship. 
     We now show that this relationship of one-to-many also applies in the reverse. given a feed of sufficient size, an unlimited number of balanced matching templates can be devised. 
     We describe a Template Builder from a given feed. Let F be a feed string comprising z letters f 1 , f 2 , . . . f z  from the transmission alphabet T: t 1 , t 2 , . . . t m . Let f i ≠f i+1  for i=1, 2, . . . (i−1). By removing f i  from F (now comprising z−1 T letters), one generates a template P. 
     Proof: applying the replica algorithm REP to P as a template and F as a feed one finds in F all the letters in P from the first p 1 =f 1 , to p i-1 =f i-1 . However the next letter in F, f 1  does not fit the template expectation, so f i  is discarded and the count moves to f i+1  which is exactly what the template expects namely f i+1 =p i . From there on f j =f j-1 , i&lt;j&lt;f−1. 
     Illustration. Let the transmission alphabet T be comprised of four letters: t 1 =X, t 2 =Y, t 3 =Z and t 4 =W. Let a feed F be: F=XYYWZXY. Letter f 3 ≠f 4 , therefore by removing from F letter f 3 , one will generate a template P=XYWZXY which is easily verified. Similarly f 6  f 7 , and therefore by removing from F letter f 6  one generates a template P′=XYYWZY, which again can readily be verified. 
     One could combine the two procedures above and remove f 3  and f 6  to generate template P″=XYWZY, as can be readily verified. 
     As the illustration indicates this procedure of removing a single letter from the feed can be applied to any letter in F to create f templates. This f procedures can be applied to any of the f letters in every combination, creating a large number of possible templates generated to match a particular feed. The count is not infinite per a given feed because the template will have to be of same size or smaller than the feed string, but since the feed can be made as large as desired, the number of corresponding templates is also as large as desired. 
     We conclude then that the REP and REPR are one-to-many both ways, and therefore knowing one leaks negligibly towards the other. In particular a cryptanalyst catching the ciphertext string, a feed, will not know what is the corresponding template it is pointing to. And the same template will be pointed to each time by a different feed. This will be assured by using randomness to select a feed to point to a given template. 
     The key to the cryptanalytic hurdle is the random selection not only of the template (the key) but also of the feed (the ciphertext). 
     The Replica algorithm is of a “loop” category. Namely, to build a template, one needs to have the template. 
     In the “loop” case where y=F y (x), if F y  is algebraic then x may point only to one or few y values which can be cryptanalyzed, for example: 
         y= 2 xy−y   2    
     It may be converted to 1=2x−y, or y=2x−1, and no other solution. Such mathematical shortcut is not available when F y  is highly randomized. In that case the cryptanalyst is limited to brute force approach which becomes effective only if the same key is used more and more. In the limited case when a cryptanalyst knows that h feeds F1, F2, . . . F h  all point to the same template P, then for h high enough the equivocation will shrink to only one template value P that would serve as a valid template for all h feed instances. If both the feed and the target are fully randomized then the effort to deduce P from the h feed instances may be credibly probability estimated. 
     Cryptographic Application of Template Processing 
     We begin with a basic application: (with revised notations). 
     Let P be the plaintext alphabet, namely the language used by the communicating parties. P has p letters. For various reasons one may wish to map P into a different alphabet regarded as the message alphabet, A, or M. There is no encryption bridge between P and A, the two have a clear mapping. For example P may be Base64, and A may be a four letters alphabet X, Y, Z, W. Every Base64 is mapped to a string of 4 A letters. 
     Let A be an alphabet comprising n letters a 1 , a 2 , . . . an. 
     Let each letter a i  for i=1, 2, . . . n be associated with a bit string b i  of length |b i |. We refer to these strings the b-strings. 
     Referring to the example above by using a four letter alphabet X, Y, Z, W there is a need to write only four bit strings b 1 , . . . b 4  rather than 64 strings. 
     When a transmitter wishes to send a recipient the letter a i , he regards the respective string b i  as a template, and constructs a feed string c i  such that when the Replica algorithm is applied to feed and template, then the result is a ‘balanced match’. Namely Replica replicates b i  from c i  such that when the replica is fully built the last bit from c i  is used to fill the last spot in the register of the reconstructed template. 
     The transmitter will check c i  against all other strings b 1 , b 2 , . . . b i−1 , b i+1  . . . b n  to make sure that with none of those strings the replica algorithm generates a balanced match. If c i  generates a balanced match with any b j  for i≠j, then the transmitter will either send over b i  as a decoy, or will discard it and at any case the transmitter will build another feed string candidate c*i. 
     The term decoy here refers to a string that is designed to fool an attacker that it represents a valid letter, alas the intended recipient will identify it as useless, a type II decoy. (We regard the decoy letters in the feed string F which were discarded as type I decoy letters). The intended recipient will do the same Replica evaluation performed by the transmitter, and if there is a balanced match with more than one b-string for the A alphabet then the recipient will conclude it is a decoy and discard it. Similarly if the string has no balanced match with any letter in A, such string will be regarded as ‘decoy’ and discarded. 
     The transmitter will try randomly to build another and another feed string c i , and then will check that c i  against all other b j  strings for j i, until the transmitter will find a c i  that does not have a ‘collision’ so to speak, namely does not have a balanced match with any other b j  for i≠j, and then the transmitter will send over that c i , which will not generate confusion on the receiving end. The recipient will find that c i  has a balanced match only with b i  and thereby the recipient will know that the string c i  sent by the transmitter was indicating the letter a i  represented by string b i . 
     This mechanism will allow the transmitter to mix real letters with decoy letters that either have a balanced match with more than one letters in A or have no match with any other letter in A. The more decoy strings are used in a mix with the proper strings, the more is the burden on the cryptanalyst. 
     Easy to Build 
     Replica is so effective because given a template T{circumflex over ( )} it is easy to build a feed string F to have balanced match with T{circumflex over ( )}. To do so one starts with F=T{circumflex over ( )}, then arbitrarily add an arbitrary number d of decoy letters (in our case here bits) into T{circumflex over ( )} such that after an arbitrary letter in T{circumflex over ( )} i  one will add a decoy letter d i  which all that is required of it is that d i ≠t{circumflex over ( )} i+1 . Another letter (or bit in this case) d′ i  can be placed following d i  as long as d′ i ≠t{circumflex over ( )} i+1 . Thereby one will add d decoy letters to T{circumflex over ( )} to create a feed F that will fit a perfect replica match with T{circumflex over ( )}. 
     In our crypto nomenclature we say that it is easy to take a b-string, b i  and construct a corresponding c-string: c i  such that Rep(c i , b i ) will constitute a balanced match. On the other hand it is not very unlikely that a given c i  will have a balanced match with another b-string b j  for i≠j. The longer the b strings the more unlikely is it that a collision will occur, namely a balanced match will be found with two or more b strings. 
     Randomization 
     The power of Replica is in its simplicity The idea is to randomize as many decisions as possible. The b strings in Replica need not be of same size. One can set them arbitrarily or to increase randomization one will set a low limit for a b string b l  and a high limit for a b string, b h . Then the parties would use a randomness source, RND, to pick a length for b i  such that 
     
       
      
       b 
       l 
       ≤|b 
       i 
       |≤b 
       h  
      
     
     for i=1, 2, . . . n. This re-sizing of letters will be used every time a key is selected. 
     Once the length of the b strings is determined then a randomness source will fill them up with bits. As a result each new Replica key will be of a variable size |K| where: 
     
       
      
       n*b 
       l 
       ≤|K|≤n*b 
       h  
      
     
     The key is the n b-strings corresponding to the message alphabet A. This is shared randomness, in possession of all the parties to these conversations. 
     The transmitter on his or her part has now the freedom to decide how much larger his c-strings will be over the corresponding b-strings. Or say how many decoy bits of the first type to insert into the starting c string which is the pointed-to b-string. 
     This decision of decoy bits count can be made randomly for each letter sent to the recipient. While this add-on of decoy bits can be arbitrarily set, it is better to use randomization here too. So the transmitter will set a lowest level for decoy bits count d l  and a highest level for decoy bits count, d h , and then use a randomization source to pick a decoy number d i  to construct ciphertext string c i  (pointing to b i , which in turn points to letter a i  in the message alphabet). 
     
       
      
       d 
       l 
       ≤d 
       i 
       ≤d 
       h  
      
     
     The size of c i  will be |c i |=|b i |+d i , for i=1, 2, . . . n. The attacker then will face a randomized c string to point to a randomized b string. 
     The transmitter at will, will generate decoy string (type II), d′ i , d′ 2 , . . . d′ a . where the number of these strings and where to put them in the transmission stream will be made arbitrarily or again in a randomized fashion. The more decoy strings type II the greater the security and the greater the longevity of the key. Recall that Tyep II decoy strings are strings that look as proper c-strings, but they either don&#39;t evaluate to a balanced match with any b string, or evaluate to a balanced match with more than one b string. 
     The transmitter will generate an arbitrary size decoy string d′, then evaluate it for having a balanced match with any of the n b-strings. If it has no balanced match with any b-string, it is a valid decoy because the recipient, in possession of the key would readily realize it is decoy. If d will evaluate to a balanced match with two or more of the b strings then, too, d′ qualifies as a type II decoy because the recipient will also identify the two balance matches and conclude that this is a decoy to be discarded. If it so happens that d′ evaluates to one balanced match with one b string and not with others then this d′ string cannot be used as decoy because it would confuse the recipient who would interpret it as the letter it points to. By selecting the b strings size properly the chance for a balance match can be controlled, either way: namely either to many matches or to no matches. 
     After using randomness to decide how may type I decoy bits to add to the b-string to construct the corresponding c-string, the transmitter can arbitrarily or randomly choose the bits in the b-string after which to add any additional type I decoy bit. 
     Generally the transmitter will decide on more decoys and large c-strings if the transmission is of high value, or the key is close to its useful life. 
     Illustration 
     Let us use a 4 letters alphabet A: a 1 =X, a 2 =Y, a 3 =Z, a 4 =W. 
     Let us specify a low and high limit for the size of the b strings: b l =6, b h =12. 
     Using a randomness source we randomly choose the bit size of the 4 b strings between b l  and b h : 
     |b 1 |=7; |b 2 |=10; |b 3 |=8; |b 4 |=6 
     Using a randomness source we define the b strings at the randomly selected size: 
         b   1 =1001101  b   2 =1110010100  b   3 =00100011  b   4 =000110 
     These 4 b strings are the shared key. (the four templates) 
     Let the transmitter wish to send the recipient the letter b 1 =X. The transmitter will specify the low and high limits of count of discarded bits: d l =4, d h =8. 
     The transmitter will start to build c 1  by copying the template, namely: c 1 =b 1 =1001101 
     The transmitter will use a randomness source and pick a number between d l  and d h , say d l =6 and d h =8, say pick  7 . 
     The transmitter will now build c 1  such that |c 1 |−|b 1 |=RND(d l , d h )=RND(6, 8)=7 
     The transmitter will now randomly pick a bit in b 1 , from the first bit, b 1,1  to the one before the last b 1,6 , say, the third bit: b 1,3 =0. The next bit in b 1 , namely b 1,4 =1. therefore the transmitter adds to the original c 1  string the bit  0  after bit  3 : 
         c   1 =100[0]1101 
     The transmitter uses again a randomness source to pick up another bit in c 1 , it come out b 1,6 =0. Since b 17 =1, then the transmitter will set a different letter namely 0: (added bits are enclosed in brackets). 
         c   1 =100[0]110[0]1 
     In a similar way the transmitter will add 5 more bits to c 1 , as follows: 
     bit  3 : after b 1,1 →c 1 =1[1]00[0]110[0]1
 
bit  4 : after b 1,5 →c 1 =1[1]00[0]11[1]0[0]1
 
bit  5 : after b 1,1 →c 1 =1[11]00[0]11[1]0[0]1
 
bit  6 : after b 1,4 →c 1 =1[11]00[0]1[0]1[1]0[0]1
 
bit  7 : after b 1,6 →c 1 =1[11]00[0]1[0]1[1]0[00]1
 
     The final shape of c 1  is 1[11]00[0]1[0]1[1]0[00]1 (the numbers in square brackets are the add on numbers]. c 1  is thus transmitted as: 
         c   1 (transmitted)=11100010110001 
     The size of c 1  is 14 bits long comprising the original 7 bits and the add-on 7 bits. 
     Before transmitting c 1  the transmitter will check it against b 2 , b 3 , b 4 : 
     b 2  as a template will not have a balanced match with c 1  as feed, the last 2 bits in c 1  are not participating in the templating: 
         c   1 →11100{0}101{1}00{{01}}
 
     Bits surrounded by curly brackets are discarded in the templating process, bits surrounded by double curly brackets are left extra in the feed after the template is fully constructed. 
     b 3  as a template will not have a balanced match with c 1  as feed, because the feed will not have enough bits to build the b 3  template. The last bit in b 3  will not be built from c 1  as feed. 
         c   1 →{111}00{0}10{11}00{0}1= b   3  without the last bit
 
     b 4  as a template will not have a balanced match with c 1  as feed because c 1  will be left with the three last bits not participating in the templating process. 
         c   1 →{111}0001{0}1{1}0{{001}}= b   4 ∥001
 
     The transmitter now confirmed that the randomized c 1  evaluates to a balanced match only with b 1 . It does not evaluate to a balanced match with any of the other letters in the alphabet. 
     The transmitter therefore will send c 1  to the recipient. The recipient will evaluate c 1  against b 1 : 
         c   1 =1{11}00{0}1{0}1{1}0{00}1= b   1    
     and finds a balanced match. The recipient then evaluates as above c 1  against b 2 , b 3 , b 4  and finds no balanced match with any of them, and thus concludes that the transmitter sent him letter b 1 . 
     The transmitter will repeat the process for as many letters as desired. All the randomizations except the key determination are unilateral, namely the transmitter exercises them on his own without pre coordination with the recipient. 
     Two Alphabets Implementations 
     The base implementation above called for a message alphabet A comprising n letters a 1 , a 2 , . . . a n , each letter a i  for i=1, 2, . . . n being represented by a bit string b i . This base implementation can be amplified by using a transmission alphabet T comprising r letters: t 1 , t 2 , . . . t r , then associating every letter from the message alphabet with a string of letters from the transmission alphabet, for instance: 
     
       
      
       a 
       5 
       =t 
       7 
       −t 
       4 
       − . . . t 
       r 
       −t 
       9  
      
     
     If the transmission alphabet is set to binary, namely r=2 and t 1 =0 and t 2 =1 then the two alphabet implementation collapsed to the base implementation. 
     The two alphabets are not imposing on each other, they can be completely different. 
     Illustration: message alphabet A is Base64: a 1 , a 2 , . . . a 64 . Transmission alphabet T is comprised of four letters: t 1 =X, t 2 =Y, t 3 =Z, t 4 =W. 
     The b-strings are of randomized length from a minimum b l =2 to a maximum b h =12. 
     So one can set: 
     
       
      
       b 
       1 
       =XYWYZ,b 
       2 
       =ZYXXYWb 
       3 
       =YYXX . . . b 
       64 
       =WWWXZXYYY  
      
     
     To build c 1  the transmitter will randomly decide that |c 1 |−|b 1 |=3, and then randomly pick b 1,1  (the first letter in b 1 ) to add a decoy letter. 
     So initially c 1 =b 1 =XYWYZ, adding one decoy letter after b 11  will be a choice between X, Z, W (any letter except Y). In this illustration the choice is random so: 
         c   1   =X [ W ] YWYZ    
     Chosing b 13  next, we have: 
         c   1   =X [ W ] YW [ X ] YZ    
     Choosing the third letter to add decoy as b 11  again (random choice), allows one to once again add a decoy letter that is any letter except Y, it may be the same as before, namely W, or a different one: 
         c   1   =X [ WZ ] YW [ X ] YZ =XWZYWXYZ 
     So constructed c 1  will evaluate to a balanced replica match with b 1 , and if it checks out to avoid any balanced match with any of the other 63 letters in the A alphabet then this c 1  string will be sent to the recipient who will repeat the same evaluations (with his own copy of the key) and decipher c 1  to point to b 1 , reflecting a 1 . 
     The transmitter can choose for each letter (i) how many decoy letters to add to the b string to construct the respective c string, and (ii) which of the (r−1) letters in the transmission alphabet T to use for the purpose of inserted decoy letter. 
     These choices may be used for subliminal messaging. 
     Subliminal Messaging 
     The Replica cipher is inflationary so to speak, it projects security through lavish expansion of bit flow. The extra bits used to project security can also be used to deliver a secondary, so called subliminal message. All in all a singular flow of bits. 
     In the Replica cipher a subliminal message can be used via the added decoy bits on top of the template towards the Feed. We describe two ways of doing so. One by using the number of decoy letters added to each letter sent as representative of a given letter, the other applies to two-alphabet implementation where the transmission alphabet has more letters than two. In that case the letter identities of the decoy letters reflect the subliminal message. 
     In case of using the letter identity method, this dual mode encryption can be applied in a cascade mode, namely to apply the Replica to the transmission letters. This can be applied iteratively indefinitely. 
     Decoy Count Subliminal Messaging 
     The number of added decoy letters can be arbitrarily set regardless of the identity of the message letter that is being transmitted. One can therefore define a subliminal alphabet S comprised of s 1 , s 2 , . . . s p  letters, and assign the integers 1, 2, . . . p one to each letter. 
     The transmitter will convey to the recipient the prime message M via the message alphabet A, and while so will convey to the recipient a subminimal message M′ via the message alphabet S. 
     Illustration: Let the prime message M=a 3 −a 1 −a 7 , and let the subliminal message M′=s 9 −s 4 −s 2 . 
     Let us set s i  to be indicated by the integer i. Thus the transmitter will build a perfect match for b 3  (to send letter a 3 ), by adding 9 decoy letters so that the transmitter will generate c 3 , such that |c 2 |−|b 3 |=9. The transmitter will add 4 decoy letters when building the letter c 1  to represent a 1 , and will create c 7  such that |c 7 |−|b 7 |=2. 
     The recipient will interpret the three letters send to him c 3 , c 1 , c 7 , as primary message M=a 3 −a 1 −a 7  written in the message alphabet A, and will interpret the same input as indicating the subliminal message M′=s 9 −s 4 −s 2 . 
     While the primary message and the subliminal message may be unrelated, they may also be related in some underlying way, say the subliminal message is an indication of the credibility of the primary message. 
     Three Alphabet Subliminal Messaging 
     We have identified three alphabets: 
     1. The Message alphabet, A: a 1 , a 2 , . . . a n  
 
2. The Transmissikon alphabet T: t 1 , t 2 , . . . t r  
 
3. The Subliminal alphabet S: s 1 , s 2 , . . . s p  
 
     The Subliminal message is comprised of add-on decoy letters with one caveat, the add on letters cannot include the letter that appears next in the template. 
     Illustration, let the template (a b-string) be: XYYZX. The randomization process points to the letter in the b-string to build some decoy letters on: 
         XYYZX→XYY -[decoy string]- ZX    
     The decoy string cannot include the letter Z otherwise it would be mistaken to a template Z. This limitation limits the free use of the subliminal alphabet for any unrelated message. This limitation can be solved in several ways, one is described right here: 
     Each of the subliminal letters in the subliminal alphabet S will have several alternate expressions written in the transmission alphabet. Each of these alternatives will have one transmission letter that is not being used. Thereby the writer would be able to construct a decoy list from transmission letters such that the decoy will not have a transmission letter that is the same as the next letter in the template. 
     For example, let the transmission alphabet be comprised of four letters T: t 1 =X, t 2 =Y, t 3 =Z, t 4 =W. 
     One can set the letters of the subliminal alphabet as follows: S comprised of four letters: s 1 =A, s 2 =B, s 3 =C, s 4 =D, where each of these four letters will have four different combinations of transmission letters to choose from: 
     A—XY XZ XW YY 
     B—YX YZ YW XX 
     C—ZX ZT ZW WW 
     D—WX WY WZ ZZ 
     So if the subliminal message needs to send the letter A, the transmitter can choose one of the four options above XY, XZ, XW, YY. If the decoy cannot include the letter X then A will be indicated by letter YY. If the decoy cannot include the letter Y then one of the two options XZ, and XW will indicate the letter A. If the decoy string cannot include the letter Z, then one of three options will do: XY, XW, YY. If the decoy cannot include the letter W then one of the three options will do: XY, XZ, YY. 
     So if the b-string is XYZXXWX, and the randomized process points to the second letter (Y) in the b string, then the decoy string cannot include the letter Z, so that it would be recognized as a decoy. 
     If the transmitter wishes to use the decoy at letter Y to send the subliminal message: M′=BAAD, then he will choose to represent B as YX, YU, XX, say choosing XX. 
     To represent the letter A, the options will be XY XW YY, say XY was chosen. The next letter in the subliminal message is also A, it can be represented the same way or in an alternative way: XW, 
     As for letter D, the options are: WX WY lets choose WY. 
     the decoy string to represent the subliminal message BAAD will be: 
     
       
      
       BAAD→XX XY XW WY  
      
     
     The decoy string for BAAD does not include Z, and hence we have 
         c   i   =XYY -[decoy string]- ZX=XYY -[ XX XYXW WY ]- ZX    
     When the recipient will template process c i  with the corresponding template b i =XYYZX, the recipient will remove the entire decoy list (between the square brackets) because it as a string without Z, and the template tell him to expect a Z. 
     The recipient will then analyze the decoy list based on the table above and will read the subliminal message as follows: 
     
       
      
       XX XYXW WY→BAAD  
      
     
     And this regardless of what the primary message said. 
     User Empowerment 
     Replica is a user-empowering cipher: the users are given power to impact the projected security. In a normal mainstay cipher today the security is fixed by the algorithm. The user has no means to affect the projected security. In some cases, like in AES, the users have a few different size keys to choose from, which is some limited empowerment. Replica, by contrast, allows its users to select any size key they wish, the larger the key the greater their security and unlike with RSA, increasing key size does not have any meaningful impact on the processing burden, so the selected key may be very large indeed. 
     Moreover the Replica transmitter can increase the projected security of each transmission by increasing the size of the decoy strings, mixing the true message with more and more digital information that increases the burden on the cryptanalyst without imposing any disturbing burden on the intended recipient of the transmission. 
     And lastly decoy string of Type II will further increase the projected security because the attacker will have to treat all the type II decoy strings as bone fide ciphertext. 
     Applications 
     We recognize: 
     1. nominal cyber security 
     2. Composite cipher applications 
     3. Pattern Hiding Applications 
     We distinguish between the Replica implementor and the Replica user. The former will specify the following: 
     Alphabets 
     1. The message alphabet
 
2. The transmission alphabet
 
3. The subliminal alphabet (if applicable)
 
4. b-strings sizes (key strings sizes) for the message alphabet
 
5. decoy string range
 
     The users will agree on: 
     6. the shared key (the b strings for the message alphabet letters) 
     And the transmitter will unilaterally decide on: 
     7. Decoy strategy 
     More specifications will be required for the subliminal messaging. 
     We also recognize a third class of users: the maintainer. Replica is designed to limit cryptanalysis to brute force class attacks, and as such the user can credibly estimate how much use can be extracted from a given key before the adversaries&#39; computing power will make progress towards revealing the key. Before such critical use level, there is a need to replace, refresh the key. Such refreshment can be taken care of by a dedicated maintenance party, so that the end user, the one sending messages back and forth, simply sends and receives messages without being bothered by the acts of encrypting and decrypting. 
     Nominal Cyber Security Applications 
     The Replica can be used any place where a symmetric cipher is called for. 
     The Replica protocol will first be specified by the implementor who will also set up any hardware, if applicable. The implementor will train the user. The user will have a safe portal to enter data and to read data. The only other control handle is for the transmitter to use it to indicate the programmed cipher how much extra security to project for a particular message, as reflected by the size of the decoy list. The maintainer will switch and refresh the key often enough to eliminate the risk of brute force cryptanalysis. 
     Software Contained Replica Application 
     Replica can be programmed as a package containing the operational logic, the randomness source (algorithmic) and the cryptographic key. 
     The Replica software may come with an input element to input data for the plaintext to undergo encryption and with an output element to send to the decrypted messages. The software will also have an input portal for the ciphertext to be decrypted, and a portal to release the ciphertext to the communication network to be transported to the intended recipient. These portals may be dedicated to the Replica or they may be part of a larger system, say an editor or a word processor, of which Replica is part. 
     The implementor here will pick the message alphabet, the transmission alphabet, and the key size. 
     For example, the implementor will pick Base64 as the message alphabet, namely 64 letters. A: a 1 , a 2 , . . . a 64 . 
     Say the implementor decided on a binary alphabet for the transmission alphabet. The implementor then will select a range for the size of the respective key strings (the b-strings): b 1 , b 2  . . . b 64 . 
     Say the range will be b l =500 bits for the low limit, and the high value b h =1500. The exact length of the b string for each letter will be randomized, so the average length of key strings will be 1000 bits Hence the size of the key will be 64*1000=64,000 bits. 
     Note: the implementor may choose not to select b-string size randomly but rather select larger strings for more common letters and smaller strings for more rare letters. 
     The implementor will then specify the size range for the decoy string, say from a minimum d min =250 to d max =1500. 
     That means that the shortest c-string to be sent for a message letter will be 500+250=750 bits and the longest c-string to be sent for a message letter will be 1500+1500=3000 bits, with an average size of 1875 bits per c-string per a message letter. Comparing it to a normal Base64, which is 6 bits per letter, the Replica ciphertext in this case is 1875/6=312.5 This high size multiplier reflects the very high security of the transmission. Most super secret messages are short text and the 300× factor is no big problem. Of course the string sizes and the decoy string sizes could have been shorter, less cumbersome to use, but less security. 
     The work organization may be such that the implementor will also invoke a randomness source to generate the key and insure its distribution among the parties to the secret conversation. 
     Software Plus Attachment Application 
     There are two elements of the Replica cipher that are candidates for external attachment: (i) the key, (ii) the randomness source. 
     The key can be attached via any memory device to the Replica processing computing device, and so for the unilateral randomness source. 
     Replica Stand Alone Box Application 
     In this mode a Replica “box” will locally connect to a non-networked computing device for input data and for reading out data. The box may directly connect to the cloud, and dispatch transmission to an intended recipient, as well as receive transmissions from the cloud for processing in the box and passing the read out to the local computer. Alternatively, the box will connect to a networked computer that will take care of the transmission back and forth. 
     The Replica box will connect to the networked computer and the non-networked computer either via a cable or through a wireless mode like NFC or Bluetooth. 
     Box Operation 
     The box is connected to the non-networked computer, called the secret computer, where the secrets are in the open. The user types, dictates, paints, and copies any digital data into this secret computer. It has no network connection. The secret computer (s-computer) has an app which allows it to communicate with the box, through standard protocols. Passing plaintext to the box and receiving plaintext from the box. Thereby the user of the s-computer is oblivious to the fact that encryption is taking place. 
     The plaintext submitted to the box along with a security indicator SI, which is a number from 1 to 100, where lower number mean lower security (shorter transmissions) and higher numbers imply greater security and larger transmissions. The higher that number the larger the decoy lists used by the Replica box. The plaintext and the SI are used by the Box to create the ciphertext. 
     If there is no networked computer then the ciphertext is routed directly to the Internet and aimed at the intended recipient. If there is a networked computer (n-computer) then the box routes the ciphertext to it for the n-computer to handle. 
     The n-computer incorporates the ciphertext routed to it from the box in a broader protocol where it manages the transmission of the ciphertext to its intended reader. The n-computer will also receive encrypted transmission from a sender, handle it and route it to the box for encryption. The box will decrypt the incoming transmission and route the corresponding plaintext to the s-computer. 
     The Replica Box 
     The Replica has the following parts: 
     1. a computer processor
 
2. a key bay
 
3. operational digital storage
 
4. source of randomness
 
5. s-computer communication ports
 
6. battery
 
7. On-Off switch
 
8. On-Off indicator
 
     and optionally: 
     9. n-computer communication ports
 
10. key data erasure button
 
11. A security envelope.
 
     Basic Box Parts 
     They are: 
     1. a computer processor
 
2. digital storage
 
3. source of randomness
 
4. s-computer communication ports
 
5. battery
 
6. On-Off switch
 
7. On-Off indicator
 
     The computer processor will process the Replica protocol. It will access data and write data to the available digital storage. 
     The computer will use a source of randomness to build the decoy list, and optionally to build keys. 
     The Replica box will communicate with the s-computer through a wire preferably because of security concerns, but optionally through a locally restricted wireless communication. 
     The box works on a battery that fits in a slot and can be replaced as needed, alternatively the battery will be rechargeable. 
     The box will be equipped with an on/off switch with built in indicator as to the on/off status. 
     Optional Box Parts 
     The optional parts are: 
     9. n-computer communication ports
 
10. key data erasure button
 
11. A security envelope.
 
     The box may communicate directly to the cloud with no need for a networked computer, but it will be more convenient to connect the box to a networked computer. The connection can be wire or wireless, no secret exposed information flows there. 
     The box may be fit with a quick key erasure bottom to protect security of past communication in case of a threat. The box may be placed in a secure enclosure that will detect any attempt to tamper with the box, and will instantly erase all sensitive data (the key). 
     Composite Cipher Applications 
     The idea here is to create a ciphertext stream which is a composite of some n plaintexts, P 1 , P 2 , . . . P n  such that by decrypting this composite ciphertext CC with a key K i  for i=1, 2 . . . n it will yield plaintext P i . 
     A composite cipher must be able to be processed by a key K i  holder such that all parts of CC that are not the ciphertext of plaintext P i  will be readily identified as unrelated, and ignored. In other words, the CC will look to each of the n key holders as being comprised of ciphertext to be decrypted to P i  and some other unrelated bits which are readily being ignored. 
     The Replica cipher immediately distinguishes between bits aimed for it, and unrelated bits so that the Replica cipher can readily be used for CC applications. 
     There are two classes we discuss here for composite cipher applications: (i) decryption differentiation, (ii) ultimate security 
     Decryption Differentiation 
     Here we have two sub categories: independent plaintexts, and dependent plaintexts. In the former the composite ciphertext, CC, is simply an aggregate of n individual ciphertexts c 1 , c 2 , . . . c n  where each c i  for i=1, 2, . . . n is decrypted by a respective key, k i  to its own plaintext p i . 
     The Replica cipher is decoy-tolerant, that means that its expected ciphertext c i  may be mixed with (n−1) other ciphertexts so that everything except c i  will be ignored by the Replica processor. In practice this allow a transmitter to prepare a single composite ciphertext CC, pass it to one of its n intended readers, which will pass the whole CC to another member of a cyber community, which in turn will find another member that has not seen this CC, and pass to him. 
     Each reader i, will extract from the CC c i  and decrypt it with k i  in its possession to the respective p i . 
     The peer-to-peer transfer of CC is slower then broadcasting CC to all the readers, but it is more resilient to network disruptions. 
     The n plaintexts may be related in many ways, for example: 
     1. questions and answers
 
2. commentary
 
3. confidentiality grading
 
     For n=2, p 1  may be a set of questions, and p 2  may be the set of answers. Students may be given k 1  to try to answer on their own, and the teacher or sometimes later they get k 2  to see the answers. 
     Commentary in p 2  could be related to p 1 , explaining further, saying something related, or commenting on the authenticity of the statement in p 1 . 
     p 1  may be the basic details of a given project, while p 2  reveals more technical details of higher security grade, while p 3  contains more sensitive data. In that case the common people on the project will be given k 1 , the more sophisticated will be given k 1  and k 2 , and the top executive echelon will be given k i , k 2 , and k 3 . Thereby access credentials will determine how much each member of the project will see in the same CC. 
     Ultimate Security 
     In a given practical situation an adversary will make a comprehensive list of possible plaintexts that could have been encrypted into a capture ciphertext: p 1 , p 2 , . . . p n . The transmitter sends p i  to its intended recipient who is in possession of k i . The intended reader discards everything in CC except c i , decrypts it and gets the p i  message. The attacker, even an infinitely strong attacker, or especially a very strong attacker, will extract from CC all the n ciphertexts and somehow manage to decrypt them to the n plaintexts (or even more). This will leave the attacker with the same entropic situation as before having cracked CC. Both before and after the attacker has a list of n plaintext candidates without being able to distinguish between them any further. The CC does not tell the attacker which of the n kyes is used by the intended reader. 
     Pattern Hiding Applications 
     The sender will maintain a constant flow, F, of randomized bits to the sender, a fixed rate of bits/seconds. Since nothing is being transmitted, all these bits will be meaningless, randomized. Should the sender have a message p to be sent to the recipient, the sender will then encrypt p with the shared key k to generate c, of size |c| bits, and will replace |c| randomized bits with the random looking |c| bits in the flow F. The recipient will distinguish c in F (ignore all other bits) and use the shared key k to decrypt c to p and receive the message. Since c in Replica is thoroughly randomized, c will blend very well within F and leak no indication that the F has contained a message. Numerous messages can be sent that way limited only by the rate of bits/sec used for F. 
     The two parties may each take the role of a sender and so a conversation will take place via two counter flowing bit flows F 1  and F 2 , which don&#39;t have to be of same bit rate. If the two counter flows are constant then the setup is not leaking any information as to the extent the frequency, the pattern of communication between the participating parties, not even a conversation took place at all. 
     This non-leakage set up can become even trickier if instead of constant flow rate, the bits/sec of F change in some way, Perhaps, the more the parties talk, the lower the F used, to give the misleading impression of no conversation when the conversation is most extensive and vice versa, to give the impression of extensive conversation (high flow rate) when nothing is communicated between the parties. 
     Packaging the Transmission 
     The transmitter wishes to send a plaintext message P to the recipient. The message is comprised of p plaintext letters. These plaintext letters are mapped to message letters in the A (or say M) alphabet. Their count is m M letters. Each of these m letters is indicated to the recipient by a ciphertext string c: c 1 , c 2 , . . . c m . 
     These m strings are of variable size, so if sent one after the other the recipient will not know how to parcel the coming stream to individual c strings. There are several ways to resolve this issue: 
     1. length indicator header
 
2. Bit doubling
 
     In both cases it would be helpful to further obscure the ciphertext by complete transposition as indicated in “Pattern Devoid Cryptography” published on IACR eprint archive. 
     Length Indicator Header 
     Let 1=b max +d h , where b max  is the largest b-string in the alphabet and d h  be the largest number of decoy bits to add to b to construct c. l then will be the largest bit count of any c string in the transmission. Let q the smallest integer for which: 
       2 q   ≥b   max   +d   h    
     Thus a string of q bits will be sufficient to indicate the size of any c string. The transmitter thus will be able to precede each c string with a header of size q bits and populate this q bits such that in binary language it will indicate the bit size of the c-string right following it. The transmitter will attach that c-string to the header. Following that string another pair of header and string will be placed and so on until the entire m letters of the transmitted message are passed ahead. This way the recipient will read in each header how long the coming c string is and where the next header starts. 
     Bit Doubling 
     By mapping bits to double-bit one will have two signals to indicate where a string starts in a steam and where it ends. So mapping 0 to ‘01 and mapping 1 to ‘10’ will leave ‘00’ and ‘11’ to be used to terminate strings. Such stream will also be very strong if transosed because the number of ones and the number of zeros is very close. 
     Abstraction 
     We consider a function f y , which depends on a value y, and where: 
         y=ƒ   y ( x ) 
     Given x, y cannot be readily computed because the computing function f y  depends on the value of y, which is what comes as a result from computing f y (x). Yet, given y it is easy to verify that y=f y (x) because y will determine y→f y . 
     This fact can be used in cryptographic protocols where prover will prove to a verifier that the prover knows the value y, by submitting x such that y=f y (x). 
     We further limit f y  to be a many-to-one algorithm, namely that there very many values for x that would result in the same value of y. In that case when this or another prover wishes to once again to prove to the verifier that they are in possession of y, they communicate another value x. A hash function is an example for such a many-to-one algorithm. 
     Another cryptographic use is encryption. Let a message alphabet A be comprised of n letters a 1 , a 2 , . . . a n , and let each letter be associated with a value b 1 , b 2 , , , , b n . A transmitter and a recipient share A and the n b-values. The transmitter may send the recipient letter a i  as part of a message going from the transmitter to the recipient, by sending a value c i =x that would compute to b i =y via a function f y  such that: y=f y (x). 
     The recipient will apply the value of c i =x to all the b values representing the alphabet A, and if only y=b i =f y (x=c i ), then the recipient will conclude that the transmitter opted to send him letter i. Any adversary not aware of b i  will not be able to extract y=b i . 
     In general given an arbitrary x value, one could pick an arbitrary z value and device f z  such that z=f z (x). Therefore knowledge of x does not give any indication as to the value of y. In other words x does not point to y. 
     Such loop-function offers resistance against known plaintext attack. Knowing that an input x points to a letter a i  does not reveal which is the b i  associated with a i . And since y can be pointed to by very many x values, it is possible to enter into the protocol a requirement for no double use of an x value to point to a y value. 
     We list several embodiments of these loop-functions: 
     1. Integer key permutation. 
     2. BitFlip 
     3. Replica 
     Integer key permutation is permutation of a list x to a list x′ determined by a key which is in the form of an integer, k. 
         x′=T ( x,k ) 
     Let x, and x′ be bit strings permutations, and the k=x or k=f(x) then given x it is easy to compute x′, but given x′ it is difficult to compute x because the reverse transposition depends on k, which in turn depends on the x transposition which is not known before the transposition is carried out, but it cannot be carried out because k is not known . . . . 
     BitFlip: it is easy to verify that two bit strings x and x′ have a required Hamming distance, d, between them, but given x, there are many y strings with a Hamming distance of d from x, it is unclear which of them is x′. 
     Replica: The feed string F ends us with a result string T but the process of F→T depends on the result T. 
     Operational Definition of the Invention 
     
         
         
           
             1. This invention describes a methodology to construct a decoy tolerant cipher where a transmission from transmitter to recipient is comprising ciphertext bits which are mixed with other bits (decoy bits) so that the recipient readily distinguishes between the ciphertext bits and the decoy bits, and the recipient decrypts the ciphertext bits and discards the decoy bits while an attacker does not know what parts of the transmission, if any, is a message passed from transmitter to recipient, as opposed to transmission of random bits, and thus the attacker is blind towards the pattern of communication between the transmitter and the recipient, and blind towards the content of the communication, if any, 
           
         
       
    
     comprising: 
     1.1. a message alphabet, A comprising n letters a 1 , a 2 , . . . a n    
     1.2. a transmission alphabet, T, comprising m letters t 1 , t 2 , . . . t m    
     1.3. a set of b-strings, b 1 , b 2 , . . . b n  comprising letters of alphabet T, where each string b i  is associated with its corresponding letter a i  for i=1, 2, . . . n 
     1.4. an algorithm called Replica that generates a replica of a b-string serving as a Template, from a c string comprising T letters, designated as the ‘Feed’, by pointing to the letters in the c string by order, and moving some of these letters one by one to a register such that the register holds a replica of the Template, and such that when the last letter of the replica is added to the register, the pointer over the c string reached the end of the c string; 
     1.5. an algorithm called a Replica Builder that builds a string c (a Feed) that generates a replica of a given b-string (a Template) comprising q letters from alphabet T according to (1.4) above 
     where the Replica Builder operates as follows: 
     one constructs a Replica output c string by first setting c=b, this is the initial setting of the c string which will evolve to its final form to become the Feed, then 
     one adds an arbitrary number g of T letters to the c string, one by one, where each of those letters is being added as follows: 
     the evolving c-string includes q letters of T: r 1 , r 2 , . . . r q , where r i  is a letter of the transmission alphabet T for i=1, 2, . . . q, in its initial setting, 
     one picks an arbitrary letter r i  for i=1, 2, . . . (q−1), from the initial setting, and injects between it and the next letter r i+1 , an arbitrary letter from T, t j  where t j ≠r i+1 ; 
     the resultant string, c, is comprising (q+g) letters and when inputted to the Replica algorithm as a Feed, with the b-string as the Template, then it generates the Template replica in the Replica register, namely, letters from the feed were moved to the register to generate an exact copy of the Template, and when this was done, the pointer over the Feed string reached the final letter in the Feed. 
     The set of n b strings b 1 , b 2 , . . . b n  is considered the encryption/decryption key and is shared by the transmitter and the recipient along with the message alphabet A and the transmission alphabet T. 
     To send a letter a i  for i=1, 2 . . . n to the recipient, the transmitter will 
     (i) use the Replica Builder algorithm to build a c-string c i  as a Feed that would generate a replica of b i  when processed through the Replica algorithm, 
     (ii) check that when c i  is Replica processed with b j  for j=1, 2, . . . (i−1), (i+1), . . . n the result is not a replica of b j    
     (iii) if c i  when Replica processed with b j  yields a replica of b j  then the transmitter denotes this string as decoy string, and repeats step (i) building another c-string. The transmitter will decide weather to discard this c i  or to send it out as decoy. 
     (iv) if c i  when Replica processed with b j  does not yield a replica of b j  for all j=1, 2, . . . (i−), (i+1), . . . n then the transmitter transmits c j  to the recipient, to communicate to them the letter a i . 
     The Recipient processes the transmitted c i  against all b i  as Template; if the transmitted c i  generates one and only one replica among all the b strings as Template then the recipient concludes that the A letter associated with this b string is the plaintext letter corresponding to c i ; 
     if the c i  string generates no replica with any b string then c i  is considered a decoy string and is being discarded by the recipient; 
     if the c i  strings generates replica with respect to two or more b strings then the c i  string is considered decoy and discarded; thereby the Replica cipher is decoy tolerant. 
     2. The method in paragraph 1 wherein the transmitter generates c-strings that do not generate a replica with any b string, or generate a replica with more than one b string, and transmits these c strings as decoy to the recipient who identifies them as decoy and ignores them; 
     and where such transmission of decoy strings can be done at a selected fixed rate and when the transmitter wishes to send a message to the recipient, they replace one or more decoy strings with c strings that point to a particular, letter, v, of the A alphabet. 
     And where the transmitter will transmit to the recipient an arbitrary message written in the A alphabet and transmitting that message letter by letter as described above by transmitting the corresponding c strings (Feeds), and mixing them with an arbitrary number of decoy strings. 
     3. The method in paragraph 2 where both parties maintain a fixed flow rate of a stream of digital strings to the other, and each injects into their streams the messages they wish to communicate to the other, thereby the parties run a conversation without projecting its pattern; 
     this injection is in the form of replacing a decoy string with a b-string that points to a letter of the message alphabet A, and its replacement is carried out without affecting the constant bit flow rate from the transmitter to the recipient so that an outside observer receives no indication that a decoy string was replaced by a letter communicating string (a ciphertext string). 
     4. The method of paragraph 1 where parameters are determined by a source of randomness, in particular source of randomness will determine: 
     4.1 the size of each of the n b strings associated with the n letters of the A alphabet, where the size is given by the number of letters from the transmission alphabet T that comprise the b strings. The transmitter will specify a low limit b l  and a high limit b h  and let randomness choose a value in between. 
     4.2 the letter content of each of the n b strings associated with the n letters of the A alphabet, in terms of the identity of the comprising T letters and their order; 
     these parameters are randomly determined and shared by the parties. They are regarded as the shared cryptographic key. 
     The following parameters are determined unilaterally by the transmitter using a source of randomness: 
     4.3 the number of g added letters used by the Replica Builder each time a c-string is built to communicate to the recipient a given letter from a message; 
     4.4 the identity of the g added letters used by the Replica Builder each time a c-string is built to communicate to the recipient a given letter from a message. 
     5. The method of paragraph 1 where the transmitter is selecting the successive values of the g added letters in the Replica Builder to communicate a secondary (subliminal) message to the recipient. A specially defined subliminal alphabet S comprising g letters s 1 , s 2 , . . . s g , will be associated each to an integer in the range 1−g: s i −i. To communicate letter s i  subliminally with communicating letter a j  from the message alphabet A, the transmitter will point to b-string b j  which is associated with a i , and do so by using the Replica Builder algorithm with b j  as the template, and building a cipherstring c j , with i added decoy letters so that |c j |=|b j |+i. The recipient will interpret c i  as pointing to letter a i  in the A alphabet and pointing to letter s j  in the subliminal alphabet S. 
     6. The method of paragraph 1 where the transmitter is selecting the identities of the letters added in the Replica Builder algorithm for the purpose of communicating to the recipient a secondary (subliminal) message. 
     7. The method of paragraph 1 where the transmitter will increase the cryptanalytic burden projected by the transmission by increasing the number of decoy strings mixed with the c strings that point to letters of the transmitted message. 
     8. The method of paragraph 1 where k alphabets A 1 , A 2 , . . . A k  are being used, and each alphabet i for i=1, 2, . . . k has n i  letters, and all L=Σn i  letters are each associated with a unique b-string comprised of a shared transmission alphabet T, and where k parties are each in possession of the b-strings of one or more alphabet and no other b-strings; 
     the transmitter would send letter j of alphabet I, a ij , to the party in possession of the b-strings (the key) for alphabet i which the other parties would interpret as decoy and discard, thereby enabling a parallel ciphertext where messages to k recipients are mixed together and each recipient sees only the message aimed for them, regarding the rest as decoy. 
     9. This invention describes a system performing Replica encryption and decryption in a stand alone box communicating with a secure computing device (s-comp) and with a networked computing device (n-comp) as well as with an external source of randomness (RND); the box contains the Replica cryptographic key, a computing component, a data storage element, and an operating battery; 
     the system is accepting plaintext from the s-comp, it encrypt it with the Replica operation described in claim  1 , using randomness from the randomness source; the digital output including mixing c-strings with decoy strings, then communicating the resultant digital message either directly to the remote recipient via the cloud, or via the local n-comp; 
     and where the box accepts encrypted messages mixed with decoy strings either directly through the cloud or via the n-comp, then the box decrypts the incoming messages and communicates the extracted plaintext to the s-comp for the recipient to read. 
     10. The method in claim  9  where the transmitter indicates to the box the amount of decoy strings to be used for mixing with the c-strings that point to a letter in the communicated message.