[密码学][困难问题][常见规约]密码学问题常见困难问题

参考网址(科学上网)
密码学问题常见困难问题,需要点击参考网址进行查找
其困难问题的介绍非常友好,请根据目录快速找到相关资料
在这里插入图片描述
在这里插入图片描述

以下是检索 目录

Discrete logarithm problem

DLP: discrete logarithm problem
CDH: computational Diffie-Hellman problem
SDH: static Diffie-Hellman problem
gap-CDH: Gap Diffie-Hellman problem
DDH: decision Diffie-Hellman problem
Strong-DDH: strong decision Diffie-Hellman problem
sDDH: skewed decision Diffie-Hellman problem
PDDH: parallel decision Diffie-Hellman problem
Square-DH: Square Diffie-Hellman problem
l-DHI: l-Diffie-Hellman inversion problem
l-DDHI: l-Decisional Diffie-Hellman inversion problem
REPRESENTATION: Representation problem
LRSW: LRSW Problem
Linear: Linear problem
D-Linear1: Decision Linear problem (version 1)
l-SDH: l-Strong Diffie-Hellman problem
c-DLSE: Discrete Logarithm with Short Exponents
CONF: (conference-key sharing scheme)
3PASS: 3-Pass Message Transmission Scheme
LUCAS: Lucas Problem
XLP: x-Logarithm Problem
MDHP: Matching Diffie-Hellman Problem
DDLP: Double Discrete Logarithm Problem
rootDLP: Root of Discrete Logarithm Problem
n-M-DDH: Multiple Decision Diffie-Hellman Problem
l-HENSEL-DLP: l-Hensel D

  • 6
    点赞
  • 27
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值