Negligible function

In mathematics, a negligible function is a function μ : N → R {\displaystyle \mu :\mathbb {N} \to \mathbb {R} } such that for every positive integer c there exists an integer N_c such that for all x > N_c,

| μ ( x ) | < 1 x c . {\displaystyle |\mu (x)|<{\frac {1}{x^{c}}}.}

Equivalently, the following definition may be used. A function μ : N → R {\displaystyle \mu :\mathbb {N} \to \mathbb {R} } is negligible, if for every positive polynomial poly(·) there exists an integer N_poly > 0 such that for all x > N_poly

| μ ( x ) | < 1 poly ⁡ ( x ) . {\displaystyle |\mu (x)|<{\frac {1}{\operatorname {poly} (x)}}.}

The concept of negligibility can find its trace back to sound models of analysis. Though the concepts of "continuity" and "infinitesimal" became important in mathematics during Newton and Leibniz's time (1680s), they were not well-defined until the late 1810s. The first reasonably rigorous definition of continuity in mathematical analysis was due to Bernard Bolzano, who wrote in 1817 the modern definition of continuity. Later Cauchy, Weierstrass and Heine also defined as follows (with all numbers in the real number domain R {\displaystyle \mathbb {R} } ):

(Continuous function) A function f : R → R {\displaystyle f:\mathbb {R} {\rightarrow }\mathbb {R} } is continuous at x = x 0 {\displaystyle x=x_{0}} if for every ε > 0 {\displaystyle \varepsilon >0} , there exists a positive number δ > 0 {\displaystyle \delta >0} such that | x − x 0 | < δ {\displaystyle |x-x_{0}|<\delta } implies | f ( x ) − f ( x 0 ) | < ε . {\displaystyle |f(x)-f(x_{0})|<\varepsilon .}

This classic definition of continuity can be transformed into the definition of negligibility in a few steps by changing parameters used in the definition. First, in the case x 0 = ∞ {\displaystyle x_{0}=\infty } with f ( x 0 ) = 0 {\displaystyle f(x_{0})=0} , we must define the concept of "infinitesimal function":

(Infinitesimal) A continuous function μ : R → R {\displaystyle \mu :\mathbb {R} \to \mathbb {R} } is infinitesimal (as x {\displaystyle x} goes to infinity) if for every ε > 0 {\displaystyle \varepsilon >0} there exists N ε {\displaystyle N_{\varepsilon }} such that for all x > N ε {\displaystyle x>N_{\varepsilon }}

| μ ( x ) | < ε . {\displaystyle |\mu (x)|<\varepsilon \,.} ^{[citation needed]}

Next, we replace ε > 0 {\displaystyle \varepsilon >0} by the functions 1 / x c {\displaystyle 1/x^{c}} where c > 0 {\displaystyle c>0} or by 1 / poly ⁡ ( x ) {\displaystyle 1/\operatorname {poly} (x)} where poly ⁡ ( x ) {\displaystyle \operatorname {poly} (x)} is a positive polynomial. This leads to the definitions of negligible functions given at the top of this article. Since the constants ε > 0 {\displaystyle \varepsilon >0} can be expressed as 1 / poly ⁡ ( x ) {\displaystyle 1/\operatorname {poly} (x)} with a constant polynomial, this shows that infinitesimal functions are a superset of negligible functions.

In complexity-based modern cryptography, a security scheme is provably secure if the probability of security failure (e.g., inverting a one-way function, distinguishing cryptographically strong pseudorandom bits from truly random bits) is negligible in terms of the input x {\displaystyle x} = cryptographic key length n {\displaystyle n} . Hence comes the definition at the top of the page because key length n {\displaystyle n} must be a natural number.

Nevertheless, the general notion of negligibility doesn't require that the input parameter x {\displaystyle x} is the key length n {\displaystyle n} . Indeed, x {\displaystyle x} can be any predetermined system metric and corresponding mathematical analysis would illustrate some hidden analytical behaviors of the system.

The reciprocal-of-polynomial formulation is used for the same reason that computational boundedness is defined as polynomial running time: it has mathematical closure properties that make it tractable in the asymptotic setting (see #Closure properties). For example, if an attack succeeds in violating a security condition only with negligible probability, and the attack is repeated a polynomial number of times, the success probability of the overall attack still remains negligible.

In practice one might want to have more concrete functions bounding the adversary's success probability and to choose the security parameter large enough that this probability is smaller than some threshold, say 2⁻¹²⁸.

One of the reasons that negligible functions are used in foundations of complexity-theoretic cryptography is that they obey closure properties.^[1] Specifically,

1. If f , g : N → R {\displaystyle f,g:\mathbb {N} \to \mathbb {R} } are negligible, then the function x ↦ f ( x ) + g ( x ) {\displaystyle x\mapsto f(x)+g(x)} is negligible.
2. If f : N → R {\displaystyle f:\mathbb {N} \to \mathbb {R} } is negligible and p {\displaystyle p} is any real polynomial, then the function x ↦ p ( x ) ⋅ f ( x ) {\displaystyle x\mapsto p(x)\cdot f(x)} is negligible.

Conversely, if f : N → R {\displaystyle f:\mathbb {N} \to \mathbb {R} } is not negligible, then neither is x ↦ f ( x ) / p ( x ) {\displaystyle x\mapsto f(x)/p(x)} for any real polynomial p {\displaystyle p} .

This section needs expansion. You can help by adding missing information. (March 2018)

• n ↦ a − n {\displaystyle n\mapsto a^{-n}} is negligible for any a ≥ 2 {\displaystyle a\geq 2} :
  • Step: This is an exponential decay function where a {\displaystyle a} is a constant greater than or equal to 2. As n → ∞ {\displaystyle n\to \infty } , a − n → 0 {\displaystyle a^{-n}\to 0} very quickly, making it negligible.
• f ( n ) = 3 − n {\displaystyle f(n)=3^{-{\sqrt {n}}}} is negligible:
  • Step: This function has exponential decay with a base of 3, but the exponent grows slower than n {\displaystyle n} (only at n {\displaystyle {\sqrt {n}}} ). As n → ∞ {\displaystyle n\to \infty } , 3 − n → 0 {\displaystyle 3^{-{\sqrt {n}}}\to 0} , so it’s still negligible but decays slower than 3 − n {\displaystyle 3^{-n}} .
• f ( n ) = n − log ⁡ n {\displaystyle f(n)=n^{-\log n}} is negligible:
  • Step: In this case, n − log ⁡ n {\displaystyle n^{-\log n}} represents a polynomial decay, with the exponent growing negatively due to log ⁡ n {\displaystyle \log n} . Since the decay rate increases with n {\displaystyle n} , the function goes to 0 faster than polynomial functions like n − k {\displaystyle n^{-k}} for any constant k {\displaystyle k} , making it negligible.
• f ( n ) = ( log ⁡ n ) − log ⁡ n {\displaystyle f(n)=(\log n)^{-\log n}} is negligible:
  • Step: This function decays as the logarithm of n {\displaystyle n} raised to a negative exponent − log ⁡ n {\displaystyle -\log n} , which leads to a fast approach to 0 as n → ∞ {\displaystyle n\to \infty } . The decay here is faster than inverse logarithmic or polynomial rates, making it negligible.
• f ( n ) = 2 − c log ⁡ n {\displaystyle f(n)=2^{-c\log n}} is not negligible, for positive c {\displaystyle c} :
  • Step: We can rewrite this as f ( n ) = n − c {\displaystyle f(n)=n^{-c}} , which is a polynomial decay rather than an exponential one. Since c {\displaystyle c} is positive, f ( n ) → 0 {\displaystyle f(n)\to 0} as n → ∞ {\displaystyle n\to \infty } , but it doesn’t decay as quickly as true exponential functions with respect to n {\displaystyle n} , making it non-negligible.

Assume n > 0 {\displaystyle n>0} , we take the limit as n → ∞ {\displaystyle n\to \infty } :

Negligible:

• f ( n ) = 1 x n / 2 {\displaystyle f(n)={\frac {1}{x^{n/2}}}} :
  • Step: This function decays exponentially with base x {\displaystyle x} raised to the power of − n 2 {\displaystyle -{\frac {n}{2}}} . As n → ∞ {\displaystyle n\to \infty } , x − n 2 → 0 {\displaystyle x^{-{\frac {n}{2}}}\to 0} quickly, making it negligible.
• f ( n ) = 1 x log ⁡ ( n k ) {\displaystyle f(n)={\frac {1}{x^{\log {(n^{k})}}}}} for k ≥ 1 {\displaystyle k\geq 1} :
  • Step: We can simplify x − log ⁡ ( n k ) {\displaystyle x^{-\log(n^{k})}} as n − k log ⁡ x {\displaystyle n^{-k\log x}} , which decays faster than any polynomial. As n → ∞ {\displaystyle n\to \infty } , the function approaches zero and is considered negligible for any k ≥ 1 {\displaystyle k\geq 1} and x > 1 {\displaystyle x>1} .
• f ( n ) = 1 x ( log ⁡ n ) k {\displaystyle f(n)={\frac {1}{x^{(\log n)^{k}}}}} for k ≥ 1 {\displaystyle k\geq 1} :
  • Step: The decay is determined by the base x {\displaystyle x} raised to the power of − ( log ⁡ n ) k {\displaystyle -(\log n)^{k}} . Since ( log ⁡ n ) k {\displaystyle (\log n)^{k}} grows with n {\displaystyle n} , this function approaches zero faster than polynomial decay, making it negligible.=
• f ( n ) = 1 x n {\displaystyle f(n)={\frac {1}{x^{\sqrt {n}}}}} :
  • Step: Here, f ( n ) {\displaystyle f(n)} decays exponentially with a base of x {\displaystyle x} raised to − n {\displaystyle -{\sqrt {n}}} . As n → ∞ {\displaystyle n\to \infty } , f ( n ) → 0 {\displaystyle f(n)\to 0} quickly, so it’s considered negligible.
• f ( n ) = 1 x n ( log ⁡ n ) {\displaystyle f(n)={\frac {1}{x^{n(\log n)}}}} :
  • Step: With an exponential base and exponent n ( log ⁡ n ) {\displaystyle n(\log n)} , this function would approach zero very rapidly, suggesting negligibility.

Non-negligible:

• f ( n ) = 1 n 1 / n {\displaystyle f(n)={\frac {1}{n^{1/n}}}} :
  • Step: Since n 1 / n → 1 {\displaystyle n^{1/n}\to 1} as n → ∞ {\displaystyle n\to \infty } , this function decays very slowly, failing to approach zero quickly enough to be considered negligible.

• Negligible set
• Colombeau algebra
• Nonstandard numbers
• Gromov's theorem on groups of polynomial growth
• Non-standard calculus

• Goldreich, Oded (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press. ISBN 0-521-79172-3.
• Sipser, Michael (1997). "Section 10.6.3: One-way functions". Introduction to the Theory of Computation. PWS Publishing. pp. 374–376. ISBN 0-534-94728-X.
• Papadimitriou, Christos (1993). "Section 12.1: One-way functions". Computational Complexity (1st ed.). Addison Wesley. pp. 279–298. ISBN 0-201-53082-1.
• Colombeau, Jean François (1984). New Generalized Functions and Multiplication of Distributions. Mathematics Studies 84, North Holland. ISBN 0-444-86830-5.
• Bellare, Mihir (1997). "A Note on Negligible Functions". Journal of Cryptology. 15. Dept. of Computer Science & Engineering University of California at San Diego: 2002. CiteSeerX 10.1.1.43.7900.