🧭 New here?
Take a guided tour of the site.
We turn each registry univalent function f into an 8×8 S-box by the keyed construction - a byte from the low mantissa bits of f(z) along a low-discrepancy disk path, filled by first occurrence - and score the five S-box criteria (nonlinearity, SAC, BIC, differential & linear probability) with a harness validated against AES (NL 112, DP 0.0156). The leaderboard ranks the whole registry; the explorer below shows each S-box, its criteria vs AES / the DCT paper / Skipjack, and its avalanche, differential and linear structure (no image is encrypted - an S-box is a byte→byte substitution, exactly as in the DCT paper). Asha’s five Ma–Minda candidates (; f = z·exp ∫(φ−1)/t) are flagged throughout. The pure-geometry “direct” rank-order is cryptographically weak and not shown.
Explore a function (top performers + ★ Asha’s candidates)
f = -
-
S-box (16×16, value→grey)
Criteria vs AES / DCT paper / Skipjack
Avalanche / SAC matrix (ideal ½)
P(output bit j flips | input bit i flips). Redder = further from ½.
Difference distribution table (DDT)
-
Linear approximation table (LAT, blue + / red −)
-
Filter by family
Search
↑↓ navigate openesc close
✦ You're explorer #3,567 to wander the registry - thanks for stopping by. Tell us what you'd like to see →
💬 Feedback