In protocol analysis, formal verification is a very important tool.
What are the major differences between CSP,Promela,... and their pro's and con's for what specific usage cases? What do you think about graphical representations of communicating systems (gCSP, v-Promela,...)? What other lesser known/used process calculi do you recommend?
Tell me more
×
Cryptography Stack Exchange is a question and answer site for
software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.
|
|
|||
|
|
|
Is your question regarding the verification of cryptographic protocols or protocols in general? I do not know much about the field and cannot answer all your questions. I do know that applied Pi calculus is quite popular for cryptographic protocols (especially in cryptographic voting protocols) and the ProVerif tool is often used. |
|||
|
|
