Reproduce “On The Simplest Quantum-Secure Block Cipher” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Gorjan Alagic, Joseph Carolan, Christian Majenz, Saliha Tokat

The two-round Even–Mansour construction withstands adaptive quantum queries in the ideal permutation model. It interleaves two independent public permutations with three independent secret XOR keys, and the adversary may query the cipher and both permutations. For q≤√(N/2), where N=2^n, distinguishing advantage is O(√(q³/N))+ε_CPO, with ε_CPO≤O(q/√N); security is shown for polynomially many queries, not concrete implementations.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.