10.2. Abstraction of cryptographic primitives
Most of the formal approaches in this area take a very abstract view of the cryptographic primitives. That is to say that they typically treat the cryptographic functions – hashes and so on – as primitives of the data types of messages, for example, and do not concern themselves with any structure they may have or algebraic identities they may satisfy. Of course where the algorithms are known to satisfy certain identities, for example that Vernam encryption is self-inverse, or that RSA is multiplicative, we can incorporate these in our analysis.
By and large cryptographic functions, expecially hash functions and block ciphers, are deliberately constructed to avoid any such simple structure. Structure ...
Get The Modelling and Analysis of Security Protocols: the CSP Approach now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
