论文部分内容阅读
In this paper, we lower the upper bound of the number of solutions of oracle transformation polynomial F(x)over GF(q). So one can also recover all the secrete keys with fewer calls. We use our generalized 'even-and-odd test'sentations of the Lucas