KiHoLee
3a9a5eebf4
check_family_enum.py now runs both attacks against both families. The outsider ranks the L-1 Walsh rows; the insider, holding m_v, ranks the L-1 products m_v .* m_r, which works because Walsh rows are closed under the elementwise product and the per-block sign cancels in m_u .* m_v. Both need a list to rank, and only the structured family supplies one: the structured family falls at 0.905 from one frame at 10 dB and 0.990 from four, the refresh takes the outsider to 0.000 and leaves the insider at 0.980, and the learned family gives 0.000 throughout. exp_full.stage_N sweeps the learned family over the same SNR grid at the same frame count as stage_A, so Fig. 2 can carry both families and a reader can see what the key space costs at every SNR rather than at one point. check_consistency.py gains four assertions for the key-space measurements and two for the learned sweep, 82 in all. README: the assertion count was two rounds stale, and the figure map omitted family_enum, cov_attack and maskdegen, whose CSVs back quoted manuscript numbers.
13 lines
319 B
CSV
13 lines
319 B
CSV
snr_db,legit,eve_wrong
|
|
0,0.45205625,0.999865625
|
|
2,0.325615625,0.9998425
|
|
4,0.224483125,0.9998196875
|
|
6,0.150013125,0.999801875
|
|
8,0.0982703125,0.9997996875
|
|
10,0.06379375,0.9997821875
|
|
12,0.0409540625,0.999758125
|
|
14,0.0259790625,0.9997684375
|
|
16,0.0165590625,0.999769375
|
|
18,0.01049375,0.999760625
|
|
20,0.006573125,0.9997428125
|