Hi everyone,
for the given parameters of the scheme, n=m=12, k=10, I cannot compute the claimed bits of classical security: 151 for the algebraic attack and 149 for Leon’s algorithm. Estimates from [RST22] seem not to apply here for such n,m and k, and still do not match the security bits, or am I missing something?