Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
From MaRDI portal
Recommendations
- On the design of hardware building blocks for modern lattice-based encryption schemes
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA
- FFT program generation for ring LWE-based cryptography
- NFLlib: NTT-Based Fast Lattice Library
Cited in
(13)- Accelerating homomorphic evaluation on reconfigurable hardware
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
- FFT program generation for ring LWE-based cryptography
- On using RSA/ECC coprocessor for ideal lattice-based key exchange
- A monolithic hardware implementation of Kyber: comparing apples to apples in PQC candidates
- On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Enhancing data parallelism of fully homomorphic encryption
- Hardware optimization and evaluation for crucial modules of lattice-based cryptography
- On the design of hardware building blocks for modern lattice-based encryption schemes
- Efficient hardware implementations of brw polynomials and tweakable enciphering schemes
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
This page was built for publication: Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915119)