Abstract
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is the API of the IBM 4758 hardware security module. We also show how our technique can be applied to standard security protocols. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
Steel, G. (2005). Deduction with XOR constraints in security API modelling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3632 LNAI, pp. 322–336). Springer Verlag. https://doi.org/10.1007/11532231_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free