摘要 精确地给出了黑客攻击能力和红客防御能力的可达理论极限.对黑客来说，如果想“真正成功”地把红客打败k次，那么一定有某种技巧，使他能够在k/C次进攻中，以任意接近1的概率达到目的；如果黑客经过n次攻击，获得了S次“真正成功”，那么一定有S≤nC.对红客来说，如果想"真正成功"地把黑客挡住R次，那么一定有某种技巧，使得他能够在R/C次防御中，以任意接近1的概率达到目的.反过来，如果红客经过N次防卫，获得了R次“真正成功”，那么一定有R≤ND.这里C和D分别是“攻击信道”和“防御信道”的信道容量.如果CD，那么红客输；如果C=D，那么红黑实力相当.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 CD, the honker will be losed; if C=D, it means that they will get considerable strength.
