Improved Greedy Nonrandomness Detectors for Stream Ciphers

Linus Karlsson, Martin Hell, Paul Stankovski

Abstract

We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the desired computational complexity. We test the algorithm on the stream ciphers Grain-128a and Grain-128, and achieve significantly better results compared to an earlier greedy approach.

References

  1. Ågren, M., Hell, M., Johansson, T., and Meier, W. (2011). Grain-128a: a new version of Grain-128 with optional authentication. International Journal of Wireless and Mobile Computing, 5(1):48-59.
  2. Banik, S., Maitra, S., Sarkar, S., and Meltem Sönmez, T. (2013). A chosen IV related key attack on Grain128a. In Information Security and Privacy: 18th Australasian Conference, ACISP 2013, Brisbane, Australia, July 1-3, 2013. Proceedings, pages 13-26. Springer.
  3. Chakraborti, A., Chattopadhyay, A., Hassan, M., and Nandi, M. (2015). Trivia: A fast and secure authenticated encryption scheme. In Cryptographic Hardware and Embedded Systems - CHES 2015: 17th International Workshop, Saint-Malo, France, September 13- 16, 2015, Proceedings, pages 330-353. Springer.
  4. De Cannière, C. (2006). Trivium: A stream cipher construction inspired by block cipher design principles. In Information Security: 9th International Conference, ISC 2006, Samos Island, Greece, August 30 - September 2, 2006. Proceedings, pages 171-186. Springer.
  5. Dinur, I. and Shamir, A. (2009). Cube attacks on tweakable black box polynomials. In Advances in Cryptology - EUROCRYPT 2009: 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings, pages 278-299. Springer.
  6. Dinur, I. and Shamir, A. (2011). Breaking Grain-128 with dynamic cube attacks. In Fast Software Encryption: 18th International Workshop, FSE 2011, Lyngby, Denmark, February 13-16, 2011, Revised Selected Papers, pages 167-187. Springer.
  7. Englund, H., Johansson, T., and Sönmez Turan, M. (2007). A framework for chosen IV statistical analysis of stream ciphers. In Progress in Cryptology - INDOCRYPT 2007: 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007. Proceedings, pages 268-281. Springer.
  8. Hell, M., Johansson, T., Maximov, A., and Meier, W. (2006). A stream cipher proposal: Grain-128. In 2006 IEEE International Symposium on Information Theory, pages 1614-1618.
  9. Liu, M., Lin, D., and Wang, W. (2015). Searching cubes for testing boolean functions and its application to Trivium. In 2015 IEEE International Symposium on Information Theory (ISIT), pages 496-500.
  10. Saarinen, M.-J. O. (2006). Chosen-IV statistical attacks on eSTREAM stream ciphers. http:// www.ecrypt.eu.org/stream/papersdir/2006/013.pdf.
  11. Sarkar, S., Banik, S., and Maitra, S. (2015). Differential fault attack against Grain family with very few faults and minimal assumptions. IEEE Transactions on Computers, 64(6):1647-1657.
  12. Sarkar, S., Maitra, S., and Baksi, A. (2016). Observing biases in the state: case studies with Trivium and TriviaSC. Designs, Codes and Cryptography.
  13. Stankovski, P. (2010). Greedy distinguishers and nonrandomness detectors. In INDOCRYPT 2010, pages 210- 226. Springer.
  14. Vielhaber, M. (2007). Breaking ONE.FIVIUM by AIDA an algebraic IV differential attack. Cryptology ePrint Archive, Report 2007/413. http://eprint.iacr.org/2007/413.
Download


Paper Citation


in Harvard Style

Karlsson L., Hell M. and Stankovski P. (2017). Improved Greedy Nonrandomness Detectors for Stream Ciphers . In Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-209-7, pages 225-232. DOI: 10.5220/0006268202250232


in Bibtex Style

@conference{icissp17,
author={Linus Karlsson and Martin Hell and Paul Stankovski},
title={Improved Greedy Nonrandomness Detectors for Stream Ciphers},
booktitle={Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2017},
pages={225-232},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006268202250232},
isbn={978-989-758-209-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Improved Greedy Nonrandomness Detectors for Stream Ciphers
SN - 978-989-758-209-7
AU - Karlsson L.
AU - Hell M.
AU - Stankovski P.
PY - 2017
SP - 225
EP - 232
DO - 10.5220/0006268202250232