01▲Code Generation of Faster Formally Verified NTT with Plantard Reduction eprint.iacr.org Can Plantard arithmetic plus a code generator make a faster verified NTT, or just a fancier proof chain?constant-timeeasycrypteprintfndsaformal-verificationjasminlatticeml-dsaml-kemnttpqc0 pts/fpike/7 days ago/3 comments