The Degree Map Decides the Zero Map: Where the Exact Zeros of a Toy Block Cipher Live
Our previous note found that at 4 rounds a 16-bit toy block cipher has exactly twice as many vanishing linear correlations as a random permutation, and that this excess of zeros is a signal. Here we ask where the zeros live and why their number is what it is, and answer in two sealed runs whose hashes were posted publicly before execution. All 13 sealed claims came out R. How many: the whole Walsh spectrum is divisible by 2^nu with nu = 8, 6, 4, 3, 2, 2, 2 for rounds 1 to 7, and in all 15 frozen codebooks nu equals 16 - max_k(delta_k - k), where delta_k is the largest degree of a product of k output coordinates (an upper bound we prove; its tightness is the empirical part). At 4 rounds the count is 2^(nu-2) times the floor to four digits (1.9997-1.9999): the coarser 2-adic lattice, not a change of position, doubles the zeros. Where: at 5 rounds the total count is back inside the floor of 40 random permutations for every frozen key, yet the zeros in the low-activity corner stand 50,358-50,837 against a floor maximum of 49,551. A count is blind where a map still sees. A reading on the 24-cell, made after the first run, did not fit, but it pointed to the cause: four rows of the Walsh table. Why: the second seal showed, row by row, that the degree of each component function sets the lattice of its row and the lattice sets its zeros (ratios 1.00, 2.00 and 4.2 for degrees 15, 14 and 13; the bound behind it is proved, its tightness is empirical). At 5 rounds a two-dimensional space of components keeps degree 14 for 200 of 200 fresh keys; it is the quadratic components of the PRESENT S-box carried around the fixed column of the bit permutation. It is gone at 6 rounds, where what survives matches random permutations. The corner count at 5 rounds was predicted from the degree map within 260 zeros for three fresh keys. The zero map of this cipher is its degree map. The work stays on a toy cipher and published methods. (1) Text: CC-BY-4.0 | Code: GNU Affero General Public License v3.0 or later (AGPL-3.0-or-later) (2) Data and code. Both seal documents with their SHA-256 files, result files, development and post-hoc logs, and allanalysis and figure scripts (AGPL-3.0-or-later) are inBridge_Paper_The_Degree_Map_Decides_the_Zero_Map_scripts_v1.0.0.zip. The seal and result hashes areposted at github.com/watabe-masanori/cds-polytope, issue #1. No external data are used. (3) AI use. Designs, code, analyses and text were produced by Kurado (Claude Opus 5.5, Anthropic) working with M. Watabe, who chose every direction and posted the hashes. Draft comments by ChatGPT and Gemini, relayed by M. Watabe, prompted Section 7 and Appendix A; they are AI commentary, not peer review.
Authors
- Masanori Watabe (ORCID: https://orcid.org/0009-0000-4441-5126)
- Anthropic) Kurado (Claude Opus 5.5
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24217244
- Citations
- 1
- Primary Topic
- Cryptographic Implementations and Security
- Type
- preprint