Formally verified number-theoretic transform

DOI10.62056/AHBN-4TW9MaRDI QIDQ7391795zbMATH OpenFDO

Authors Alix Trieu

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AHBN-4TW9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cites work

• A survey of polynomial multiplications for lattice-based cryptosystems
• Accelerating verified-compiler development with a verified rewriting engine
• Computer-Aided Security Proofs for the Working Cryptographer
• Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
• Formally verifying Kyber. Episode V: machine-checked IND-CCA security and correctness of ML-KEM in Easycrypt
• Fully homomorphic encryption using ideal lattices
• HOL Light: An Overview
• scientific article; zbMATH DE number 1863383 (Why is no real title available?)
• scientific article; zbMATH DE number 7378548 (Why is no real title available?)
• The Lean 4 theorem prover and programming language
• Towards a scalable proof engine: a performant Prototype rewriting primitive for Coq

This page was built for publication: Formally verified number-theoretic transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391795)