You are looking at a specific version 20020701:171202 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
discrete logarithm problem
Contact author(s)
alex @ fermat ma rhul ac uk
History
2002-07-01: received
Short URL
https://ia.cr/2002/086
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.