There is a question:(adsbygoogle = window.adsbygoogle || []).push({});

In constructing obfuscators for point-functions theory, there is a statement that there exists a polynomial-time computable permutation

[tex]pi : B^n -> B^n[/tex] and a constant c such that for every polynomial s(n) and every adversary A of size s for all sufficiently large n,

[tex] Prob[A(pi(x)) = x] <= S(n)^c/2^n [/tex]

I am trying to prove that

[tex]S^c(n)/2^n[/tex]

where s is a polynomial and c is a constant, is also a negligible function.

Could anyone help me with that?

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Negligible function question.

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**