Abstract:

The theoretical limitation of hacker attack ability and honker defense ability was given. If a hacker wants to successfully beat honker k times, he should have so good skills that he can achieve the purpose with probability arbitrarily close to 1 in the k/C times' offensive; If a hacker achieve S times' real success after n times' attack, there must be S≤nC. For the honker, if he wants to really successfully defense the hacker for R times, he must have so good skills that he can achieve the purpose with probability arbitrarily close to 1 in the k/C times' defensive; If a honker achieve N times' real success after N times' defensive, there must be R≤ND. C and D respectively represents the channel capacity of offensive channel and defensive channel. If C<D, the hacker Honker will be losed; If C>D, the honker will be losed; if C=D, it means that they will get considerable strength.

Key words: hacker, honker, offensive, defensive, channel