Hard-core predicate

A hard-core predicate is a concept from cryptography, particularly in the context of cryptographic primitives like pseudorandom generators and one-way functions. It refers to a function or value that is difficult to compute when given only limited information about a related hard problem, typically the output of a one-way function.