证明了在分解整数困难的前提下,2^m次根方案在同步攻击下是安全的.
It is proved that it is secure under the concurrent attacks if factoring integers are hard.