Paper 2015/327
Some results on Sprout
Subhadeep Banik
Abstract
Sprout is a lightweight stream cipher proposed by Armknecht and Mikhalev at FSE 2015. It has a Grain-like structure with two State Registers of size 40 bits each, which is exactly half the state size
of Grain v1. In spite of this, the cipher does not appear to lose in security against generic Time-Memory-Data Tradeoff attacks due to the novelty of its design. In this paper, we first present improved results on Key Recovery with partial knowledge of the internal state. We show that if 50 of the 80 bits of the internal state are guessed then the remaining bits along with the Secret Key can be found in a reasonable time using a SAT solver. Thereafter we show that it is possible to perform a distinguishing attack on the full Sprout stream cipher in the multiple IV setting using around
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- subb @ dtu dk
- History
- 2015-04-13: received
- Short URL
- https://ia.cr/2015/327
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/327, author = {Subhadeep Banik}, title = {Some results on Sprout}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/327}, year = {2015}, url = {https://eprint.iacr.org/2015/327} }