integer factorization

基本解釋

• [計算機科學(xué)技術(shù)]整數(shù)分解

英漢例句

雙語例句

• The rapid development of quantum computing brings great challenge to cryptographic protocols based on the integer factorization or the discrete logarithm problem.
  量子計算的快速發(fā)展給基于整數(shù)分解或離散對數(shù)問題的密碼協(xié)議帶來嚴(yán)重威脅。
• Its(security) is based on the intractability of the integer factorization problem as RSA, and it is able to resist the chosen-ciphertext attack against RSA and easy to be implemented.
  它與RSA算法相似，其安全性基于大數(shù)因式分解的難度，能夠抵抗對于RSA的選擇密文攻擊，并且易于軟件實現(xiàn)。
• Theory analysis indicates that security of the modified ElGamal-like algorithm is based on the intractability of the integer factorization problem and conventional discrete log problem.
  通過理論分析得出該算法的安全性基于大整數(shù)分解和求解離散對數(shù)的難解性。

• integer factorization更多例句

詞組短語

短語

• integer factorization problem 整數(shù)分解問題;基于整數(shù)因子分解問題;基于大整數(shù)分解問題;整數(shù)因子分解問題
• large integer factorization 大整數(shù)因子分解
• The Integer Factorization Problem 背包問題
• big integer factorization 大整數(shù)分解
• integer LDL T factorization 整數(shù)LDLT分解

• integer factorization更多詞組

專業(yè)釋義

計算機科學(xué)技術(shù)

• 整數(shù)分解

  A publicly verifiable multi-secret sharing scheme is proposed, using non-interactive zero-knowledge proof protocol and Shamir’s sharing system. The security of the scheme is based on the intractability of integer factorization problem and discrete logarithm problem.
  基于大整數(shù)分解以及離散對數(shù)問題的難解性,使用非交互的零知識證明協(xié)議,以Shamir共享體制為基礎(chǔ)提出一種公開可驗證的門限多秘密共享方案。