Experimenting with Shuffle Block Cipher and SMT Solvers

We experiment with the block cipher proposed by Hoang, Morris, and Rogaway [3], even though the cipher is insecure [8]. The cipher is based on swap-or-not shu e, and we call it the Shu e Block Cipher. We show how the cipher can be translated into SMT-LIB v2 format, suitable for automated solving by SMT solvers. We compare performance of various SMT solvers on the encryption and known plaintext attack problems.