因数分解 meaning in English

factorize
integer factorization
resolution into factors

Asymmetric - key cryptography , which we will discuss in chapter 10 , is based on some topics in number theory , including theories related to primes , factorization of composites into primes , modular exponentiation and logarithm , quadratic residues , and the chinese remainder theorem
我们将在第十章中讨论非对称密钥密码学，非对称密钥密码学基于一些数论的论题，这些论题与素数、把复合数分解为素数的因数分解、模指数与模对数、二次剩余和中国剩余定理有关。
The elliptic curve digital signature algorithm ( ecdsa ) is the elliptic curve analogue of the digital signature algorithm ( dsa ) . it was accepted in 1999 as an ansi standard , and was accepted in 2000 as ieee and nist standards . unlike the ordinary discrete logarithm problem and the integer factorization problem , no subexponential - time is known for the elliptic curve discrete logarithm problem . for this reason , the strength - per - key - bit is substantially greater in an algorithm that uses elliptic curves
椭圆曲线数字签名算法（ ecdsa ）是数字签名算法（ dsa ）的椭圆曲线对等。它先后成为ansi ， ieee ， nist和iso的标准，而且其它的一些组织正在考虑成为其标准。不象普通的离散对数问题和因数分解问题，椭圆曲线离散对数问题没有已知的亚指数算法，所以使用椭圆曲线的算法在密钥的位强度是足够高的。