Does there exist a variant of the Socialist Millionaires protocol that allows one party to learn if x==y but the other party cannot learn if x==y? Or is it possible for one party to "defect" at some point to achieve this result?
@apsillers You might have better luck asking that on the main site, The Side Channel tends to be pretty slow and is not frequented by as many users as the front page is.
I don't like the idea of asking a question that's too broad or too un-researched. It may be more chat worthy than post worthy... How would cryptanalysis of a ChaCha-like stream cipher work if the main difference were changing the permutation function?
And I mean with a novel permutation, not like keccak's permutation or gimli. I'm wondering about weaker permutations that would still be safe in a ChaCha-like construct because there aren't many ways to attack it.
