1. ILOG CPLEX, http://www.ilog.com/products/cplex/
2. Beigel, R.: The polynomial method in circuit complexity. In: Structure in Complexity Theory Conference, pp. 82–95 (1993)
3. McDonald, C., Charnes, C.: An algebraic analysis of Trivium ciphers based on the boolean satisfiability problem. Cryptology ePrint Archive, Report 2007/129 (2007), http://eprint.iacr.org/2007/129.pdf
4. Lecture Notes in Computer Science;C. Cannière De,2006
5. De Cannière, C., Preneel, B.: Trivium specifications. ECRYPT eSTREAM Project (2006), http://www.ecrypt.eu.org/stream/p3ciphers/trivium/trivium_p3.pdf