Volume 37 Issue 5
Dec.  2017
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2008  >  37(5): 709-711,741

FAN An-dong, SUN Qi. Application of DFT Over Finite Field FP in the Secret Sharing Scheme[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(5): 709-711,741.
Citation: FAN An-dong, SUN Qi. Application of DFT Over Finite Field FP in the Secret Sharing Scheme[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(5): 709-711,741.
shu

Application of DFT Over Finite Field FP in the Secret Sharing Scheme

  • 1.

    College of Mathematics,Sichuan University Chengdu 610064;

  • 2.

    National Laboratory for Modern Communications Chengdu 610041;

  • 3.

    Information Management College,Chengdu University of Technology Chengdu 610059

  • Received Date: 2007-12-27
  • Rev Recd Date: 2008-03-25
  • Publish Date: 2008-10-15
  • In order to increase the calculation speed of the n sharing's generation and the m partners to recover the secret in Shamir(m,n) threshold scheme, the discrete Fourier transform (DFT) over finite field is adopted other than the classical Lagrange interpolation. Because the DFT over finite field has some similar properties of the DFT over complex, such as the cycling convolution and the FFT algorithm, this method can improve the efficient of Shamir(m,n) threshold scheme. If m >[n/2], it can increase the calculation speed of the trust center to divide the key to n sharing components. Moreover, if m=n and it is the power of 2, this scheme can increase the calculation speed of the partners to recover the secret key.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Get Citation
PDF
XML

Article Metrics

Article views(3825) PDF downloads(60) Cited by()

Related
Proportional views

Application of DFT Over Finite Field FP in the Secret Sharing Scheme

  • 1. College of Mathematics,Sichuan University Chengdu 610064;
  • 2. National Laboratory for Modern Communications Chengdu 610041;
  • 3. Information Management College,Chengdu University of Technology Chengdu 610059
  • Received Date: 2007-12-27
  • Rev Recd Date: 2008-03-25
  • Publish Date: 2008-10-15

Abstract: In order to increase the calculation speed of the n sharing's generation and the m partners to recover the secret in Shamir(m,n) threshold scheme, the discrete Fourier transform (DFT) over finite field is adopted other than the classical Lagrange interpolation. Because the DFT over finite field has some similar properties of the DFT over complex, such as the cycling convolution and the FFT algorithm, this method can improve the efficient of Shamir(m,n) threshold scheme. If m >[n/2], it can increase the calculation speed of the trust center to divide the key to n sharing components. Moreover, if m=n and it is the power of 2, this scheme can increase the calculation speed of the partners to recover the secret key.

FAN An-dong, SUN Qi. Application of DFT Over Finite Field FP in the Secret Sharing Scheme[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(5): 709-711,741.
Citation: FAN An-dong, SUN Qi. Application of DFT Over Finite Field FP in the Secret Sharing Scheme[J]. Journal of University of Electronic Science and Technology of China, 2008, 37(5): 709-711,741.
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return