基于Fp上插值多项式的可验证随机数

针对随机数与伪随机数的随机性在不泄露种子密钥的情况下，随机性无法被验证的缺点，以有限域上插值多项式为基础，构造了可被广泛验证的随机数生产方案。基于有限域上插值多项式理论构造的可验证随机数，具有无误差、效率高的特点。为适应参与人数过多的情况，给出了多项式的多层结构，提高构造及验证的效率。当参与人数以指数增加时，计算量仅以线性增加。该方案在协议参与者众多时仍然具有高效性，适合于移动终端使用。

Verifiable Random Number Based on Interpolating Polynomial over Fp

Random number and pseudo-random number can not be verified without seed key, which restricts its application in electronic commerce. Based on Interpolating polynomial over finite field, a scheme for generating verifiable random number is proposed. The scheme eliminates the error which is inevitable for interpolating polynomial over real number field. A multi-level structure is designed to accommodate huge number participants. Even if the number of participants increases exponentially, the computational time only rises lineally, which make it suitable for mobile users.