1) complexity hypothesis
复杂假说
2) complex man hypothesis
复杂人假设
3) assumptions of complication
复杂性假设
4) Multiple alleles hypothesis
复等位基因假说
5) multi-factor hypothesis
复合因子假说
6) computational complexity assumption
计算复杂性假设
1.
A novel computational complexity assumption, called non-pairing based generalized bilinear Diffie-Hellman assumption is analyzed, and then it is typically applied to the security proof of one or two certificateless public key cryptographic schemes.
分析了不基于配对的广义双线性Diffie-Hellman计算复杂性假设,将其典型应用在一到两个无证书公钥密码方案的安全性证明上,在证明了以前没有证明或证明有误的无证书公钥密码方案的安全性的同时,引出了一个方法论结论,为一类无证书公钥密码体系的安全证明提供了一种独特的思路。
补充资料：复杂
（事物的种类、头绪等）多而杂：颜色～ㄧ～的问题ㄧ～的人际关系。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条