Exact Active S-Box Lower Bounds for a Feistel Cipher via MILP

Stéphane Gaël Raymond Ekodeck provides exact Mixed Integer Linear Programming models to compute provable lower bounds on the number of differentially active S-boxes in a Feistel cipher with a key-dependent permutation. The repository contains code that solves models up to 11 rounds, outputs LaTeX-ready result tables, and generates a round-wise growth plot. The dataset was last updated on April 25, 2026.

Use Cases

• Provable security analysis of Feistel ciphers based on the provided MILP models.
• Benchmarking cipher designs against differential attacks based on the computed lower bounds for active S-boxes.
• Generating publication-ready tables and plots for cryptographic research papers based on the LaTeX and plotting outputs.

Strengths

• Provides exact, provable lower bounds for a specific cryptographic analysis problem.
• Includes two distinct models: a simplified model and a full adversarial model.
• Code solves models up to 11 rounds, offering a concrete analysis scope.

Limitations

• The dataset is very small at 32.4 KB, indicating limited scope and likely containing only code and documentation.
• Row count and column-level documentation are absent; data structure must be inferred after download.
• Last updated 2026-04-25 07:48:57; freshness should be verified.

Provenance

Source

Stéphane Gaël Raymond Ekodeck via figshare

Collection Method

Computational models and code generated for research.

Freshness

Last updated 2026-04-25 07:48:57.