Encoding Method Sample Clauses

Encoding Method. An identity can be written as an IP address which is 32 bits long. A number in each octet ranges from 0 to 255. These 256 numbers must be mapped into braid words for each octet. Normally a braid a ∈ Bn can be written in at most (n-1)1 + … + (n-1)n-1 positive braids as shown in the following; 1-word long; (n-1)1 words, for example; {σ1, σ2, σ3, σ4} 2-word long; < (n-1)2 words, for example; {σ1σ1, σ1σ2, σ1σ3, σ1σ4, σ2σ1, σ2σ2, σ2σ3, σ2σ4, σ3σ2, σ3σ3, σ3σ4, σ4σ3, σ4σ4} 3-word long; < (n-1)3 words, for example; {σ1σ1σ1, σ1σ1σ2, σ1σ1σ3, …, σ4σ4σ4} 4-word long; < (n-1)4 words, for example; {σ1σ1σ1σ1, σ1σ1σ1σ2, σ1σ1σ1σ3, …, σ4σ4σ4σ4} But using the above method, care must be concerned in that two braid words can produce the same value such as σ1σ2σ1 = σ2σ1σ2 or σ1σ3 = σ3σ1. For ease of implementation, my suggestion is that each octet in an IP address can be mapped by using B5 which has 8-word long as shown in Table 4.1. For example IP address in the following can be mapped into braid words; IP address 10.5.32.255 mapped into σ4σ4σ4σ4σ1σ4σ1σ4. σ4σ4σ4σ4σ4σ1σ4σ1. σ4σ4σ1σ4σ4σ4σ4σ4. σ1σ1σ1σ1σ1σ1σ1σ1. Thus gil = σ4σ4σ4σ4σ1σ4σ1σ4 σ4σ4σ4σ4σ4σ1σ4σ1 and gir = σ4σ4σ1σ4σ4σ4σ4σ4 σ1σ1σ1σ1σ1σ1σ1σ1. In the Table 4.1, a braid word representing each octet contains only σ1 and σ4 in it. In case of the proposed scheme, the private key gi of each user is in the different braid groups, so it must be mapped into the different braid groups.