Similar Items: Fast polynomial inversion algorithms for the post-quantum cryptography
- Extended version: enabling lattice-based post-quantum cryptography on the opentitan platform
- Research and implementation of large-scale S-box for MK-3 algorithm based on polynomial basis: in FPGA
- Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
- Faster $$text {GF}(2)[x]$$ polynomial multiplication using SIMD instructions
- Adaptive Tangent Homomorphic Encryption with Equivariant Quantum Neural Networks for Secure Data Transmission Routing in MANET
- Implementations of FAST and AEZ on field programmable gate arrays for low level encryption of disks with 4096-byte sectors