Claw finding problem
id:
claw-finding-problem-319-2305299
title:
Claw finding problem
text:
The claw finding problem is a classical problem in complexity theory, with several applications in cryptography. In short, given two functions f, g, viewed as oracles, the problem is to find x and y such as f(x) = g(y). The pair (x, y) is then called a claw. Some problems, especially in cryptography, are best solved when viewed as a claw finding problem, hence any algorithmic improvement to solving the claw finding problem provides a better attack on cryptographic primitives such as hash functio
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Claw_finding_problem
date created:
date modified:
2023-05-25T07:17:06Z
main entity:
{"identifier":"Q85752744","url":"https://www.wikidata.org/entity/Q85752744"}
image:
fields total:
13
integrity:
13