Hardware optimization and evaluation for crucial modules of lattice-based cryptography

DOI10.13209/J.0479-8023.2021.054MaRDI QIDQ3385127zbMATH OpenWikidataFDO

Authors Zhaohui Chen, Yuan Ma, Jiwu Jing

Publication date 17 December 2021

Full work available at URL https://doi.org/10.13209/J.0479-8023.2021.054

zbMATH Keywords

butterfly operationnumber theoretic transformationpolynomial multiplicationpost-quantum cryptography

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
• On the design of hardware building blocks for modern lattice-based encryption schemes
• Improvement of lattice-based cryptography using CRT
• Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
• On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA

Cited in

(8)

• On using RSA/ECC coprocessor for ideal lattice-based key exchange
• On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA
• Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
• Improvement of lattice-based cryptography using CRT
• On the design of hardware building blocks for modern lattice-based encryption schemes
• Exploring the solution space: CB-WCA for efficient finite field multiplication in post-quantum cryptography
• Towards automating cryptographic hardware implementations: a case study of HQC
• Hardware acceleration of NTT-based polynomial multiplication in CRYSTALS-Kyber

This page was built for publication: Hardware optimization and evaluation for crucial modules of lattice-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385127)