Security of Polynomial Transformations of the Diffie--Hellman Key

Igor Shparlinski

Paper 2000/023

Security of Polynomial Transformations of the Diffie--Hellman Key

Igor Shparlinski

Abstract

D. Boneh and R. Venkatesan have recently proposed an approachto proving that a reasonably small portions of most significant bits of the Diffie-Hellman key modulo a prime are as secure the the whole key. Some further improvements and generalizations have been obtained by I. M. Gonzales Vasco and I. E. Shparlinski. E. R. Verheul has obtained certain analogies of these results in the case of Diffie--Hellman keys in extensions of finite fields, when an oracle is given to compute a certain polynomial function of the key, for example, the trace in the background field. Here we obtain some new results in this direction concerning the case of so-called "unreliable" oracles.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: public-key cryptography
Contact author(s): igor @ ics mq edu au
History: 2002-07-04: last of 2 revisions; 2000-05-26: received; See all versions
Short URL: https://ia.cr/2000/023
License: CC BY

BibTeX

@misc{cryptoeprint:2000/023,
      author = {Igor Shparlinski},
      title = {Security of Polynomial Transformations of the Diffie--Hellman Key},
      howpublished = {Cryptology ePrint Archive, Paper 2000/023},
      year = {2000},
      note = {\url{https://eprint.iacr.org/2000/023}},
      url = {https://eprint.iacr.org/2000/023}
}