Skip to main content Accessibility help
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 3 - Optimization of linear trails

  • Tim Beyne, Katholieke Universiteit Leuven, Belgium, Vincent Rijmen, Katholieke Universiteit Leuven, Belgium
  • Book:
    Linear Cryptanalysis
    Published online:
    17 December 2025
    Print publication:
    20 November 2025, pp 34-51

  • Summary

    Finding linear trails with high absolute correlation quickly becomes tedious work, especially for ciphers with a more complicated structure than the example that we have worked with so far. Since the total number of trails is finite, finding linear trails with a maximal absolute correlation is an example of a combinatorial optimization problem. This chapter discusses three commonly used optimization methods: Matsui’s branch and bound method, mixed-integer linear programming, and satisfiability or satisfiability modulo theories. At the same time, the chapter introduces two additional example ciphers that follow a different design strategy.