汉诺塔问题古老而有趣，是经常用作程序设计递归算法的典型例题。
Hnaoi Problem is an old-aged yet interesting one, which is often used as an typical example for recursive algorithm in program design.
文章以“汉诺塔”游戏为出发点，分析设计了一个高强度的公平的不可抵赖的签约协议。
According to the" nono n-repudiation game of Hanoi Tower", This paper analyzes a fair and non-repudiation signed-contract-cryptographic-protocol(SCCP)with strong safety.
应用推荐