Paper 2014/919 Original: eprint.iacr.org/2014/919 ↗
Experimenting with Shuffle Block Cipher and SMT Solvers
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.
- History
- 2014-11-10: last updated
- 2014-11-10: published
- Short URL
- https://ia.cr/2014/919
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2014/919}
}