Bivium as a Mixed-Integer Linear Programming Problem-Reference-Cited by-同舟云学术

Bivium as a Mixed-Integer Linear Programming Problem

Published:2009 Issue: Volume: Page:133-152
ISSN:0302-9743
Container-title:Cryptography and Coding
language:
Short-container-title:

Author:

Borghoff Julia,Knudsen Lars R.,Stolpe Mathias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-10868-6_9.pdf

Reference10 articles.

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

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Fibonacci View on the Galois NFSR Used in Trivium;Journal of Systems Science and Complexity;2024-04-08

2. Online Incentive Mechanism Design for Real-Time Decision Making: Case Study of Collaborative Task Offloading in Mobile Edge Computing;SpringerBriefs in Computer Science;2024

3. Using SAT Solvers to Finding Short Cycles in Cryptographic Algorithms;International Journal of Electronics and Telecommunications;2023-07-26

4. SuperBall: A New Approach for MILP Modelings of Boolean Functions;IACR Transactions on Symmetric Cryptology;2022-09-09

5. Online Incentive Mechanism Design in Edge Computing;Wireless Networks;2022