###
DOI:
Journal of Software:2007.18(7):1738-1745

Dixon结式在密码学中的应用
唐樨瑾,冯勇
(中国科学院,成都计算机应用研究所,自动推理实验室,四川,成都,610041)
Applying Dixon Resultants in Cryptography
TANG Xi-Jin,FENG Yong
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3228   Download 2978
Received:October 09, 2005    Revised:April 17, 2006
> 中文摘要: 针对密码学中的多变元多项式二次方程系统求解问题,基于扩展Dixon结式提出了一种求解算法DR(Dixon resultants).基本思想为对于MQ(multivariate quadratic)问题,把x1,x2,…,xn-1当作变元,而把xn当作参数,然后利用和改进扩展Dixon结式方法求解该类系统.分析了该算法对于一般情况的复杂度,并且基于实验证据猜测:对于某些稀疏问题,新算法的复杂度很有可能也是多项式的.实验结果表明,对于m=n的一般和稀疏的问题,DR效率优于已有的两种算法.除了高效性,新算法还具有复杂度容易度量、计算时间可以预测的优点.
Abstract:Based on extended Dixon resultants, a new algorithm DR (Dixon resultants) is proposed to solve the system of multivariate polynomial equations. The basic idea of DR is to apply the extended Dixon resultants method to the system of multivariate polynomial equations, by taking x1,x2,…,xn-1 as variables and xn as parameter. The time complexity of DR technique is evaluated. It seems to be polynomial when the system is sparse and m=n, and the mixed volume is polynomial. Moreover, DR technique is compared with Buchberger’s algorithm and XL technique in this paper. It is shown that DR is far more efficient than Buchberger’s algorithm and XL when m=n. DR is a quite efficient algorithm and makes a good use of the sparsity of the sparse system. Besides its efficiency, another advantage of DR is that its complexity is easy to determine.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National Basic Research Program of China under Grant No.2004CB318003 (国家重点基础研究发展计划(973)) Supported by the National Basic Research Program of China under Grant No.2004CB318003 (国家重点基础研究发展计划(973))
Foundation items:
Reference text:

唐樨瑾,冯勇.Dixon结式在密码学中的应用.软件学报,2007,18(7):1738-1745

TANG Xi-Jin,FENG Yong.Applying Dixon Resultants in Cryptography.Journal of Software,2007,18(7):1738-1745