Abstract: In this paper, we propose three modular multiplication algorithms that use only the IEEE 754 binary floating-point operations. Several previous studies have used floating-point operations to ...

Abstract: Modular multiplication is a vital operation in the Number Theoretic Transform (NTT), significantly enhancing polynomial multiplication in Post-Quantum Cryptography (PQC). The design ...

Per-row weight norm clipping for accelerated generalization. Eliminates grokking delay without weight decay or gradient filtering. Single-seed demonstration on the 2-layer architecture (Lion, lr=10⁻³, ...

This proposal creates a precompiled contract that performs NTT and Inverse NTT transformations. This provides a way to efficiently perform fast polynomial multiplication for post-quantum and STARK ...