Similar Items: Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
- Modular Path Queries with Arithmetic
- A flexible efficient and configurable number theoretic transform architecture implemented on FPGA
- Faster $$text {GF}(2)[x]$$ polynomial multiplication using SIMD instructions
- Fast polynomial inversion algorithms for the post-quantum cryptography
- New lattice-based partial key exposure attacks on common prime RSA
- Research and implementation of large-scale S-box for MK-3 algorithm based on polynomial basis: in FPGA