Cryptology ePrint Archive: Report 2002/086

Adapting the weaknesses of the Random Oracle model to the Generic Group model.

Alexander W. Dent

Abstract: This paper presents results that show that there exist problems in that are provably hard in the generic group model but easy to solve whenever the random encoding function is replaced with a specific encoding function (or one drawn from a specific set of encoding functions). We also show that there exist cryptographic schemes that are provably hard in the generic group model but easy to break in practice.

Category / Keywords: public-key cryptography / discrete logarithm problem

Date: received 1 Jul 2002

Contact author: alex at fermat ma rhul ac uk

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

Version: 20020701:171202 (All versions of this report)

Short URL: ia.cr/2002/086

Discussion forum: Show discussion | Start new discussion