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

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

• 论文 • 上一篇    下一篇

有限域上可验证随机数的快速构造及安全性分析

叶俊1,2,丁勇1,刘忆宁1,曹建宇1   

  1. (1.桂林电子科技大学数学与计算科学学院,广西 桂林 541004;
    2.四川理工学院理学院,四川 自贡 643000)
  • 收稿日期:2011-03-12 修回日期:2011-06-18 出版日期:2012-05-25 发布日期:2012-05-25
  • 基金资助:

    国家自然科学基金资助项目(60963024);广西自然科学基金资助项目(0991079);广西研究生教育创新计划资助项目(2010105950701M31)

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

摘要:

利用有限域上的插值多项式来构造可验证随机数,并且结合Lagrange插值法与Newton插值法给出了可验证随机数的两种快速构造方法。此方法构造的可验证随机数,具有无误差、效率高的特点。然后对此可验证随机数的不可预测性和不可操控性等安全性进行了分析,最后通过算例验证了此方法的正确性。

关键词: 可验证随机数, 不可预测性, 验证, 不可操控性, 插值多项式

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