您要查找的是不是:
- 計算性Diffie-Hellman問題computational Diffie-Hellman problem
- 隨后,本文討論了混合可驗證加密簽名體制的安全模型,并在隨機諭示模型下,基于雙線性映射的計算性D iffie-Hellman問題難解性假設,證明本文體制是可證安全的.Then,we provide some theoretical discussions for the security model for MVESSs,and show that our new scheme can be proven to secure with the hardness assumption of the computational Diffie-Hellman problem of pairings in the random oracle model.
- 計算Difiie-Hellman問題computational Diffie-Hellman problem
- 計算Diffie.Hellman問題computational Diffie-Hellman problem
- 關于實數的可計算性On the computability of real numbers
- 沒問題No problem.
- 知性intellectuality
- 安全問題safety issue
- 計算Diffie-Hellman(CDH)假設computational Diffie-HeUman assumption
- 耐久性wear
- 保障性indemnificatory
- 沒有問題all serene
- 密鑰可用于確定密鑰協議,如使用Diffie-Hellman密鑰協議算法創建的密鑰。The key can be used to determine key agreement, such as a key created using the Diffie-Hellman key agreement algorithm.
- 敏感性sensibility
- 常見問題FAQ
- 整體性globality
- 處理問題handling problem
- 魯棒性robustness
- 出現問題go wrong
- 能行可計算性函數漸進優超等價類的可達性質ON ACCESSIBLE PROPERTIES OF EQUIVALENCE CLASSES OF EFFECTIVE COMPUTABLE FUNCTIONS