This is a reply to: https://mail.langsec.org/pipermail/langsec-discuss/20130305/000104.html
I too am a long-time lurker, first-time poster :-) I attended Michael and Dominic's great talk at Shmoocon a couple days ago, in which they reported some empirical success culminating from the project described in the original post. They used a search-based approach to enumerate linear block codes with the isolation property. Inspired, I wondered if the computation would be more efficient if cast as a constraint reasoning problem. Therefore, after their talk I coded up a quick proof-of-concept that can enumerate isolated complementary linear block codes using satisfiability modulo theories. Here's a quick write-up on it, including a link to a forked version of Michael and Dominic's code repository containing my implementation: http://digitaloperatives.blogspot.com/2014/01/unambiguous-encapsulation-defending.html I think it's a very interesting research area, and I hope that these contributions will be useful for the project. - Evan _______________________ Evan A. Sultanik, Ph.D. Chief Scientist Digital Operatives, LLC Mobile: +1 215 919 7234 _______________________________________________ langsec-discuss mailing list langsec-discuss@mail.langsec.org https://mail.langsec.org/cgi-bin/mailman/listinfo/langsec-discuss