CONNOTECH Experts-conseils Inc.

Numerical Example for the Core Frogbit Data Integrity Algorithm

© 1997 CONNOTECH Experts-conseils Inc.


              m{i}    0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
             k1{i}    1  0  1  1  0  0  0  0  0  0  1  0  1  1  1  0  1  1  1  1  1  1  1
s{i}=m{i}XOR k1{i} 0  1  0  1  1  0  0  0  0  0  0  1  0  1  1  1  0  1  1  1  1  1  1  1
             k2{i}    1  0  1  1  0  0  1  1  1  1  1  1  1  1  0  0  0  1  0  1  0  1  1
              e{i}    0  0  0  0  0  0  1  1  1  1  0  1  0  0  1  0  1  0  1  0  1  0  0

              r(i) 0  0  0  0  1  0  1  2  3  4  5  0  0  0  1  2  0  0  1  2  3  4  5  6
  r'(i)=r(i) mod 2 0  0  0  0  1  0  1  0  1  0  1  0  0  0  1  0  0  0  1  0  1  0  1  0
        run length     1  1  1     2    >2    >2     2  1  1    >2  1  1    >2    >2    >2
              d(i)     1  0  1     4     7     9     5  1  1     8  0  0     8     8     9
             d'(i)  0  1  5  2  2  2  2  0  0  8  8  9  8  0  0  8  1  8  8  0  0  6  6  8

                 i  0  1  2  3  4  5  6  7  8  9  10 11 12 13 14 15 16 17 18 19 20 21 22 23
             i'(i) -1  0  1  2  2  4  4  6  6  8  8  10 11 12 12 14 15 16 16 18 18 20 20 22
           T(i)[0]  0  5  4  1     9     5     7     5  8  4     1  8  6     9     2     7
           T(i)[1]  1  8  2  5     7     4     0     8  0  9     7  4  8     4     5     8
           T(i)[2]  2  7  6  7     4     9     1     2  6  1     6  3  7     2     0     2
           T(i)[3]  3  9  3  0     5     6     8     4  9  7     0  9  3     5     7     4
           T(i)[4]  4  3  7  2     8     2     6     9  5  3     8  7  9     8     6     3
           T(i)[5]  5  2  9  8     3     7     9     6  3  5     9  2  5     1     4     0
           T(i)[6]  6  4  5  9     6     3     2     0  1  0     2  6  1     7     3     1
           T(i)[7]  7  0  1  6     0     1     5     1  4  6     4  5  4     0     9     6
           T(i)[8]  8  6  0  3     2     0     3     7  2  8     5  1  0     6     1     5
           T(i)[9]  9  1  8  4     1     8     4     3  7  2     3  0  2     3     8     9

k1{i}.k2{i}, gen 0    11 01 01 11 10 11 10 10 01 00 00 11 10 01 01 11 10 11 10 10 00 01 10 11
k1{i}.k2{i}, gen 1    00 10 01 00 10 00 11 11 01 11 11 00 00 00 10 11 01 00 11 01 10 01 00 10
k1{i}.k2{i}, gen 2    11 00 00 01 10 10 00 10 11 11 11 10 10 01 11 00 10 00 00 11 11 11 11 11
k1{i}.k2{i}, gen 3    11 00 11 10 01 01 01 10 01 10 01 01 00 10 01 10 11 11 10 00 01 10 00 11
k1{i}.k2{i}, gen 4    11 10 01 11 10 01 01 00 11 10 10 11 01 10 01 00 00 10 01 01 11 10 11 10
k1{i}.k2{i}, gen 5    11 00 10 10 01 01 00 10 10 00 01 01 01 10 11 00 11 01 01 01 00 11 11 00
k1{i}.k2{i}, gen 6    11 11 01 10 00 00 10 10 01 10 00 01 11 10 11 11 11 11 01 10 01 00 11 00
k1{i}.k2{i}, gen 7    00 11 01 01 00 00 01 00 11 00 00 01 10 10 11 00 10 00 11 00 11 10 11 11
k1{i}.k2{i}, gen 8    01 11 11 00 11 10 11 00 01 01 01 01 10 11 11 11 01 11 01 10 11 10 11 00
k1{i}.k2{i}, gen 9    01 00 01 10 10 11 01 11 11 11 11 11 00 00 11 00 01 00 00 00 10 10 00 11
 Position of gen 0  0  1  1  1  1  1  1  1  2  3  3  3  3  3  4  5  5  5  5  5  6  7  7  7  7
 Position of gen 1  0  0  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  2  2  2  2  2  2  2  2
 Position of gen 2  0  0  0  0  1  2  3  4  4  4  4  4  4  4  4  4  4  4  4  4  4  4  4  4  4
 Position of gen 3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
 Position of gen 4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
 Position of gen 5  0  0  0  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1
 Position of gen 6  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  2
 Position of gen 7  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
 Position of gen 8  0  0  0  0  0  0  0  0  0  0  1  2  2  3  3  3  4  4  5  6  6  6  6  6  7
 Position of gen 9  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  1  1  1  1  1  1  1  1  1  1

security scheme designalternative to PKIpatent publicationsSAKEMscholarly web contentsconsulting services ]
[ CONNOTECH home page: http://www.connotech.com/about us | e-mail to: info@connotech.com ]

CONNOTECH Experts-conseils Inc.
9130 Place de Montgolfier
Montréal, Québec, Canada, H2M 2A1
Tél.: +1-514-385-5691 Fax: +1-514-385-5900