This question was inspired from the discussion related to this question on security StackExchange.
Now I was wondering given a scenario, is there a general approach to prove that a cryptographic protocol is possible/not possible for a the constraints provided? All I could think of was, trial and error. Develop a protocol, see if you can break it and if not, then you have your answer.

  • 1
    $\begingroup$ Schneier's Law (or one of them?) is 'any amateur can design a cipher he himself can't break' -- what matters is whether it can be broken by someone who knows how to break ciphers. The same principle applies to security systems more generally. $\endgroup$ – dave_thompson_085 Nov 17 '16 at 15:03

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.