Similar Items: Fast polynomial inversion algorithms for the post-quantum cryptography
- Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
- Faster $$text {GF}(2)[x]$$ polynomial multiplication using SIMD instructions
- Implementations of FAST and AEZ on field programmable gate arrays for low level encryption of disks with 4096-byte sectors
- Trust Aware Multi Objective V2V Routing Using a Quantum Inspired Trust Aware Opportunistic Routing (Q-TAOR)
- High throughput pipelined implementation of SHA3 hash algorithm on FPGA
- Multi-microblaze based parallel implementation of elliptic curve digital signature algorithm for blockchain network