期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
零知识证明协议研究
1
作者 张引兵 王慧 《赤峰学院学报(自然科学版)》 2014年第7期6-9,共4页
在当代密码学中,零知识证明占据着重要的位置.已经成为信息安全领域身份认证的关键技术之一,吸引了许多学者的注意,并得到了一系列的重要研究成果.文章首先阐述了零知识证明的主要思想、零知识证明协议的性质以及零知识证明协议所主要... 在当代密码学中,零知识证明占据着重要的位置.已经成为信息安全领域身份认证的关键技术之一,吸引了许多学者的注意,并得到了一系列的重要研究成果.文章首先阐述了零知识证明的主要思想、零知识证明协议的性质以及零知识证明协议所主要基于的几类数学问题.接着,着重研究了零知识证明在相关问题中的应用.最后,对本文进行了总结,以期能够吸引更多的学者在更广泛的领域对零知识证明协议进行研究. 展开更多
关键词 密码学 零知识证明 数独 多项式函数根 身份认证
下载PDF
On a Property of Roots of Polynomials 被引量:1
2
作者 麦结华 刘新和 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2001年第1期17-20,共4页
In [l], a property of roots of polynomials is considered, which involves the existence of local analytic solutions of polynomial-like functional iterative equations. In this paper we discuss this property and obtain a... In [l], a property of roots of polynomials is considered, which involves the existence of local analytic solutions of polynomial-like functional iterative equations. In this paper we discuss this property and obtain a succinct condition to decide whether this property holds. Our main result is: A polynomialλnzn+''' + λ2z2 + λlz + λ0 of degree n has a root or such that inf{|λnanm +... + λ2a2m + λ1am+ λ0|: m = 2, 3,.. .} > 0 if and only if at least one of the following two conditions holds: (i) the polynomial has a root β satisfying |β| > 1; (ii) the polynomial has a root β satisfying |β| < 1, and λ0≠0 展开更多
关键词 POLYNOMIAL ROOT functional iterative equation irrational rotation.
下载PDF
Real polynomial iterative roots in the case of nonmonotonicity height ≥ 2 被引量:3
3
作者 YANG LiLi YANG Lu +1 位作者 YU ZhiHeng ZHANG WeiNian 《Science China Mathematics》 SCIE 2012年第12期2433-2446,共14页
It is known that a strictly piecewise monotone function with nonmonotonicity height ≥ 2 on a compact interval has no iterative roots of order greater than the number of forts. An open question is: Does it have iterat... It is known that a strictly piecewise monotone function with nonmonotonicity height ≥ 2 on a compact interval has no iterative roots of order greater than the number of forts. An open question is: Does it have iterative roots of order less than or equal to the number of forts? An answer was given recently in the case of "equal to". Since many theories of resultant and algebraic varieties can be applied to computation of polynomials, a special class of strictly piecewise monotone functions, in this paper we investigate the question in the case of "less than" for polynomials. For this purpose we extend the question from a compact interval to the whole real line and give a procedure of computation for real polynomial iterative roots. Applying the procedure together with the theory of discriminants, we find all real quartic polynomials of non-monotonicity height 2 which have quadratic polynomial iterative roots of order 2 and answer the question. 展开更多
关键词 iterative root POLYNOMIAL algebraic variety Sylvester resultant ELIMINATION
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部