Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Faster $$text {GF}(2)[x]$$ polynomial multiplication using SIMD instructions
Saved in:
| Published in: | Journal of Cryptographic Engineering |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Faster $$text {GF}(2)[x]$$ polynomial multiplication using SIMD instructions
- Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
- Fast polynomial inversion algorithms for the post-quantum cryptography
- Research and implementation of large-scale S-box for MK-3 algorithm based on polynomial basis: in FPGA
- A Lightweight Framework Using Signcryption Based Key Agreement Scheme with Location Privacy for D2D Communications in 5G VANETs
- Understanding the Use of Artificial Intelligence in Cybercrime
- Netlist whisperer: extensive analysis of circuit leakage using LLMs