4 problems

Random alternant-code filtration conjecture. We expect that

T-310 invariant conjecture. For any Boolean function, there exists one or several low-degree invariants $P$ such that T-310 is broken by the paper's ciphertext-only attack, and the…

KT1-key attack-count conjecture. The actual number of KT1 keys broken by the exact attacks of this paper should be closer to $2^{80}$ than to $2^{65}$, out of approximately…

Let $M$, $n$, and $\delta$ denote the parameters of the DSA lattice attack, with $n$ the number of messages and $delta$ the relevant leakage parameter. The conjecture. The value of…