搜索结果: 1-3 共查到“密码学 generic hardness”相关记录3条 . 查询时间(0.062 秒)
Generic Hardness of Inversion on Ring and Its Relation to Self-Bilinear Map
MCDH unbalanced modulus
font style='font-size:12px;'>
2018/5/22
In this paper, we study the generic hardness of the inversion problem on a ring, which is a problem to compute the inverse of a given prime cc by just using additions, subtractions and multiplications...
Generic Hardness of the Multiple Discrete Logarithm Problem
multiple discrete logarithm search-by-hyperplane-queries generic group model
font style='font-size:12px;'>
2016/1/7
We study generic hardness of the multiple discrete logarithm problem, where the
solver has to solve n instances of the discrete logarithm problem simultaneously. There are
known generic algorithms w...
The Generic Hardness of Subset Membership Problems under the Factoring Assumption
Cryptographic assumptions subset membership quadratic residuosity
font style='font-size:12px;'>
2009/6/10
We analyze a large class of subset membership problems related to integer factorization. We
show that there is no algorithm solving these problems eciently without exploiting properties of the
give...