Skip to main content
Log in

Finding slid pairs in trivium with MiniSat

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

A pair of distinct (key, IV) is said to be slidable if they can produce two identical keystreams up to a shift. In this paper, we investigate slid pairs in Trivium. We convert the resulting nonlinear sliding equations into a SAT instance and use MiniSat, a SAT solver, to solve it. We not only find more slid pairs than previous result on slid pair in Trivium but also provide a new method which can treat higher clock-shifts and is much less time-consuming.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Robshaw M. The eSTREAM project. New stream cipher designs. LNCS, 2008, 4986: 1–6

    Google Scholar 

  2. Bard G, Courtois N, Jefferson C. Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. Cryptology ePrint Archive, Report 2007/024, 2007

    Google Scholar 

  3. Soos M, Nohl K, Castelluccia C. Extending SAT solvers to cryptographic problems. LCNS, 2009, 5584: 244–257

    Google Scholar 

  4. Soos M, Nohl K, Castelluccia C. SAT solvers in the context of stream ciphers. Presentation for Jurnées C2. 2009. http://planete.inrialpes.fr/?soos/talks/index.htmlurl

    Google Scholar 

  5. Soos M. SAT solvers in the context of cryptography. Presentation at Rennes. 2010. http://planete.inrialpes.fr/soos/talks/index.htmlurl

    Google Scholar 

  6. McDonald C, Charnes C, Pieprzyk J. http://www.ecrypt.eu.org/stream/papersdir/2007/040.pdf. Attacking Bivium with MiniSat

  7. Mcdonald C, Charnes C, Pieprzyk J. An algebraic analysis of trivium ciphers based on the boolean satisfiability problem. http://eprint.iacr.org/2007/129.pdf

  8. Eibach T, Pilz E, Völkel G. Attacking Bivium using SAT solvers. LNCS, 2008, 4996: 63–76

    Google Scholar 

  9. Eibach T, Pilz E, Steck S. Comparing and optimising two generic attacks on Bivium. In: Workshop on The State of the Art of Stream Ciphers (SASC2008). 2008. 57–68

    Google Scholar 

  10. Hong J. Discussion forum. Certain pairs of key-IV pairs for Trivium, created September 13, 2005 05:11PM. http://www.ecrypt.eu.org/stream/phorum/read.php? 1,152

  11. Priemuth-Schmid D, Biryukov A. Slid pairs in Salsa20 and Trivium. LCNS, 2008, 5365: 1–14

    MathSciNet  Google Scholar 

  12. Eén N, Sörensson N. MiniSat-a SAT solver with conflict-clause minimization. In: Proceedings of Theory and Applications of Satisfiability Testing(SAT 2005). 2005. http://www.cs.chalmers.se/Cs/Research/FormalMethods/Mini-Sat/MiniSat.htmlurl

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to WenFeng Qi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeng, W., Qi, W. Finding slid pairs in trivium with MiniSat. Sci. China Inf. Sci. 56, 1–8 (2013). https://doi.org/10.1007/s11432-012-4676-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-012-4676-6

Keywords

Navigation