{"version":"1.0","type":"link","title":"Claw finding problem - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}