- 更多网络例句与素因式分解相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The main contributions of the paper are listed as follows:(1) Propose methods of key-locks, such as equations set, Newton's interpolation formula, and the prime factor decomposition theorem, to implement access control.
论文的主要研究成果为：(1)提出了利用方程组、牛顿插值公式和素因子分解因式等钥—锁配对法来实现一般的访问控制。
-
In the following two cases:(1)gcd=1;(2) N=p〓, where p denotes the characteristic of the finite field GF, by using the factorization of the polynomial in finite field, the counting function N〓 is showed, the expected value of the linear complexity E〓 is determined, and a useful lower bound on the expected value of the k-error linear complexity E〓 is established.(7) The stability of the lattice structure for pseudorandom number sequences is put forward.
利用多项式的因式分解等简单工具，研究了任意有限域GF上，周期N与p互素以及N ＝P〓这两种情况下，计数函数N〓，的值，即线性复杂皮为c的N-周期序列的个数，并给出了线性复杂度的数学期望E〓的值以及k-错线性复杂度的数学期望E〓的一个有用的下界，这里p表示有限域GF的特征。
-
In the following two cases:(1)gcd = 1 ;(2)N = p~v, where p denotes thecharacteristic of the finite field GF, by using the factorization of the polynomialin finite field, the counting function N_(N,0) is showed, the expected value of thelinear complexity E_(N,0) is determined, and a useful lower bound on the expectedvalue of the k-error linear complexity E_ is established.(7) The stability of the lattice structure for pseudorandom number sequences is putforward.
利用多项式的因式分解等简单工具，研究了任意有限域GF上，周期N与p互素以及N = p~v这两种情况下，计数函数NN，0 的值，即线性复杂度为c的N-周期序列的个数，并给出了线性复杂度的数学期望EN，0的值以及k-错线性复杂度的数学期望EN，k的一个有用的下界，这里p表示有限域GF的特征。
- 更多网络解释与素因式分解相关的网络解释 [注：此内容来源于网络，仅供参考]
-
prime factorization：质因式分解
prime factor 质因 ,素因 | prime factorization 质因式分解 | prime formula 原始公式