Name
Abstract | ||
|---|---|---|
We consider a certain generalization of the hidden number problem introduced by Boneh and Venkatesan in 1996. Considering the XTR variation of Diffie-Hellman, we apply our results to show security of the log1/2p most significant bits of the secret, in analogy to the results known for the classical Diffie-Hellman scheme. Our method is based on bounds of exponential sums which were introduced by Deligne in 1977. We proceed to show that the results are also applicable to the LUC scheme. Here, assuming the LUC function is one-way, we can in addition show that each single bit of the argument is a hard-core bit. |
Year | Venue | Keywords |
|---|---|---|
2002 | CRYPTO | bit security,exponential sum,certain generalization,single bit,luc scheme,xtr variation,hard-core bit,classical diffie-hellman scheme,addition show,luc function,hidden number problem,significant bit |
Field | DocType | Volume |
Discrete mathematics,Exponential function,Hidden number problem,XTR,Algebra,Cryptography,Analogy,Elliptic curve,Mathematics,Discrete logarithm | Conference | 2442 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-44050-X | 14 |
PageRank | References | Authors |
0.73 | 31 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| wenching winnie li | 1 | 46 | 4.14 |
| Mats Näslund | 2 | 141 | 21.58 |
| Igor E. Shparlinski | 3 | 1339 | 164.66 |