A one-way function is efficiently computable but computationally infeasible to invert on a randomly sampled input with nonnegligible success probability, under its stated security assumption. An RSA cryptosystem supplies the candidate map on units modulo . Inversion hardness is an assumption; it is not a proved consequence of merely choosing large primes.
A **one-way function** is a type of mathematical function that is easy to compute in one direction but hard to reverse. In other words, given an input (or a set of inputs), it is relatively straightforward to calculate the output, but given the output, it is computationally infeasible to determine the original input.
New to topics? Read the docs here!