Ship the learned-key pipeline, without which six figures cannot be rebuilt

The package was missing every script behind the KM (lrn.) curves and
both learned table rows: exp_learned's driver, the merge that folds the
learned rows into sec_compare.csv and refresh_summary.csv, and the
report that reads the learned numbers back. It was also missing
sec_keylen_perm.csv, so Fig. 3 could not be regenerated at all, and the
two diagnostics that answer why a fixed key beats a learned one here and
where a learned mask would win instead.

The learned artifacts themselves are regenerated. They were trained on
the cross-entropy alone, which drifts to disjoint sparse supports: 99
percent of each key's energy on about six of the 64 entries, so a digit
is decided over a sixth of its period and the key set is a choice of
support rather than a dense direction in R^L. They are now the
regularized keys of Section V-C, and check_consistency asserts which of
the two families the figures draw.

Verified from inside this repository: replot_security.py rebuilds all
seven result figures, make_tables.py reproduces both result tables, and
check_consistency.py passes every check that does not need the
manuscript.

The README now lists what ships. Its run list, layout and figure map had
none of the learned pipeline, named two tables the manuscript renders as
prose, and gave Fig. 3 no data file for its permutation curve.
This commit is contained in:
KiHoLee
2026-08-28 23:58:01 +09:00
parent ffe56b4b25
commit 138897aa8d
35 changed files with 853 additions and 168 deletions
+73
View File
@@ -0,0 +1,73 @@
# -*- coding: utf-8 -*-
"""Fold the learned-key rows into the two table sources.
Table IV reads sec_compare.csv and Table V reads refresh_summary.csv,
and both are written by the structured stages, which know nothing about
the learned family. Its rows were appended by hand, so a rerun of the
learned stages left the tables behind. This does the fold, so both files
are derived from data/ like every other table source.
Run after code/run_learned_reg.py, before code/make_tables.py.
"""
from __future__ import annotations
import csv
from pathlib import Path
DATA = Path(__file__).resolve().parents[1] / "data"
def read(name):
with open(DATA / name) as f:
r = csv.DictReader(f)
return r.fieldnames, list(r)
def write(name, fields, rows):
with open(DATA / name, "w", newline="") as f:
w = csv.DictWriter(f, fieldnames=fields)
w.writeheader()
w.writerows(rows)
def upsert(rows, key, value, row):
"""Replace the row carrying key==value, or append it."""
for i, r in enumerate(rows):
if r[key] == value:
rows[i] = row
return rows
rows.append(row)
return rows
def main():
# Table IV: the learned scheme row, measured by exp_learned.compare
fields, rows = read("sec_compare.csv")
_, learned = read("compare_learned.csv")
assert len(learned) == 1, "compare_learned.csv should carry one row"
rows = upsert(rows, "scheme", "proposed_learned",
{k: learned[0][k] for k in fields})
write("sec_compare.csv", fields, rows)
print("sec_compare.csv proposed_learned jam0 %s"
% learned[0]["jam0_ser"])
# Table V: the learned refresh row, averaged over the blocks that
# exp_learned.refresh measured, at the same entropy as the
# structured refresh because the invariance group is the same
fields, rows = read("refresh_summary.csv")
_, blocks = read("refresh_learned.csv")
lg = sum(float(r["legit_ser"]) for r in blocks) / len(blocks)
ev = sum(float(r["eve_ser"]) for r in blocks) / len(blocks)
ent = next(r["entropy_bits"] for r in rows
if r["scheme"] == "Invariant, KM (str.)")
rows = upsert(rows, "scheme", "Invariant, KM (lrn.)",
{"scheme": "Invariant, KM (lrn.)",
"legit": "%.6f" % lg, "eve": "%.6f" % ev,
"entropy_bits": ent})
write("refresh_summary.csv", fields, rows)
print("refresh_summary.csv Invariant, KM (lrn.) legit %.5f eve %.5f"
% (lg, ev))
if __name__ == "__main__":
main()