Cryptology ePrint Archive: Report 2014/919

Experimenting with Shuffle Block Cipher and SMT Solvers

Martin Stanek

Abstract: We experiment with the block cipher proposed by Hoang, Morris, and Rogaway, even though the cipher is insecure. The cipher is based on swap-or-not shuffle, and we call it the Shuffle 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.

Category / Keywords: secret-key cryptography / block ciphers, cryptanalysis

Date: received 8 Nov 2014, last revised 10 Nov 2014

Contact author: stanek at dcs fmph uniba sk

Available format(s): PDF | BibTeX Citation

Version: 20141110:210309 (All versions of this report)

Short URL: ia.cr/2014/919

Discussion forum: Show discussion | Start new discussion