Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography

Date: received 25 May 2000, last revised 4 Jul 2002

Contact author: igor at ics mq edu au

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20020704:122749 (All versions of this report)

Short URL: ia.cr/2000/023

Discussion forum: Show discussion | Start new discussion