1) integer LDL T factorization
整数LDLT分解
2) LDLT decomposition
LDLT分解
1.
A recursive algorithm for calculating the eigenvalues of a real symmetric matrix based on LDLT decomposition is given.
基于线性代数与矩阵理论,给出利用LDLT分解计算实对称矩阵特征值的递归算法。
3) factorization
[,fæktərai'zeiʃən]
整数分解
1.
Qiuxin Wu,et al proposed two digital signature schemes(WYH1 and WYH2) whose security is claimed to be based on discrete logarithms problem and factorization problem simultaneously.
对两个同时基于离散对数和整数分解问题的数字签名方案———WYH1和WYH2进行了安全性分析。
2.
Xiao Long proposed a digital signature scheme(HQ) whose security is claimed to be bases on discrete logarithms prob- lem and factorization problem simultaneously.
对一个建立在圆锥曲线上的同时基于离散对数和整数分解问题的数字签名方案—HQ 进行了安全性分析。
4) integer factorization
整数分解
1.
Analysis and improvement on two kinds of integer factorization algorithm;
两类整数分解算法的分析与改进
2.
The speed of the cryptographic system is high in that only several modular multiplications and a multiplication for low-dimensional matrix and vector are used during encryption and decryption,while the security of the new system is based on the intractability assumption of integer factorization.
该公钥密码算法的安全性基于大整数分解的困难性。
3.
The analysis result indicates that the published parameters can make the modulus n be factorized using the Weda\'s theorem,and shows that the Xiao 06 scheme is not a scheme whose security based on the integer factorization problem.
通过对一个剩余类环Zn上圆锥曲线Cn(a,b)数字签名方案(X iao 06方案)的安全性分析,发现该方案的公开参数选取和算法设计存在问题,导致利用韦达定理可以分解模数n,说明X iao06方案的安全性不是基于整数分解难题的。
5) factoring integers
分解整数
1.
In this paper, we first present Weng-Long Chang and Minyi Gao s algorithm[1] factoring integers (with bit length 2k) by DNA method .
论文首先介绍了Weng-LongChang等人[1]用DNA方法分解整数(2k比特长)的算法,并与Beaver[2]的算法相比较。
6) integer factorization
大整数分解
1.
We present a new scheme for authenticated key exchange,the security of which is based on both discrete logarithm and big integer factorization.
提出一种基于身份认证的密钥交换新方案,其安全性是同时基于离散对数和大整数分解难问题的。
2.
This paper introduces three hard problems (Big Integer Factorization,Discre te Logarithm over Prim Field and Elliptic Curve Discrete Logarithm)and the Publ ic-key Cryptosystems based on them.
介绍了基于大整数分解问题,普通素数域上离散对数问题和椭圆曲线点群上的离散对数问题的公钥密码系统给出了它们的实现方案以及常用的攻击算法和算法复杂度。
补充资料：非整数订价策略
非整数订价策略
odd pricing strategy
非整数订价策略(odd prieing strategy)给商品制定一个带零头价格的订价策略。这种策略的通常做法是:使价格的最后一位数为奇数或者接近于零的数。‘心容易给消费者造成一种价格偏低和订价准确的错觉，有利于刺激消费。不同的国家和地区消费者对数字偏好有所不同，在选择零头数字时应考虑这种差异。 (张玉峰撰马谋超审)
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条