Reputation
505
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
4 14
Impact
~16k people reached

2d
awarded  Popular Question
Jan
27
revised Hamiltonicity proof of knowledge
deleted 4 characters in body
Jan
12
accepted Periodic One Way Function
Jan
11
asked Periodic One Way Function
Nov
19
awarded  Nice Question
Nov
9
awarded  Notable Question
Oct
27
awarded  Yearling
Jun
28
awarded  Notable Question
Mar
17
awarded  Popular Question
Feb
23
revised How to show that a function is not a PRP?
added 287 characters in body
Feb
21
revised How to show that a function is not a PRP?
edited body
Feb
21
comment How to show that a function is not a PRP?
If a truly random permutation is behind the oracle then for the $i$-th query the probability that $w_r=w_a$ is at most $\frac{2^{n-1}}{2^n-i+1}$ which asymptotically converges to $\frac{1}{2}$ and thus the probability for $n$ queries converges to $2^{-n}$. If you agree I'll edit my answer.
Feb
21
comment How to show that a function is not a PRP?
btw,setting 010 wouldn't change it.
Feb
21
revised How to show that a function is not a PRP?
missed the point of the term 'parity-bit'
Feb
21
comment How to show that a function is not a PRP?
you right, I just noticed that parity bit is different thing. Will edit. Thanks
Feb
21
answered How to show that a function is not a PRP?
Feb
13
awarded  Excavator
Feb
13
revised Can we say that if $P=NP$ there is no CPA secure public key encryption?
not a critical change.
Feb
13
suggested approved edit on Can we say that if $P=NP$ there is no CPA secure public key encryption?
Feb
13
comment Can we say that if $P=NP$ there is no CPA secure public key encryption?
In theory of cryptography a polynomial time algorithm does mean fast