Paper 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.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
block cipherscryptanalysis
Contact author(s)
stanek @ dcs fmph uniba sk
History
2014-11-10: revised
2014-11-10: received
See all versions
Short URL
https://ia.cr/2014/919
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/919,
      author = {Martin Stanek},
      title = {Experimenting with Shuffle Block Cipher and SMT Solvers},
      howpublished = {Cryptology ePrint Archive, Paper 2014/919},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/919}},
      url = {https://eprint.iacr.org/2014/919}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.