• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (5): 35-39.

• 论文 • Previous Articles     Next Articles

Fast Construction and Security Analysis of the Verifiable Random Numbers in the Finite Field

YE Jun1,2,DING Yong1,LIU Yining1,CAO Jianyu1   

  1. (1.School of Mathematics and Computational Science,
    Guilin University of Electronics Technology,Guilin 541004;
    2.School of Science,Sichuan University of Science and  Engineering,Zigong 643000,China)
  • Received:2011-03-12 Revised:2011-06-18 Online:2012-05-25 Published:2012-05-25

Abstract:

Using the interpolation polynomials in the finite field, and adopting the Lagrange interpolation and Newton interpolation respectively, two methods of constructing verifiable random numbers, are proposed. They have the advantages of high efficiency and no error. Then their security attributes such as uncontrollability and unpredictability are analyzed. Finally some experiments are given to verify the correctness of the two methods.

Key words: verifiable random number;unpredictability;verification;uncontrollability;interpolation polynomial