Performance and Efficiency Exploration of Hardware Polynomial Multipliers for Post-Quantum Lattice-Based Cryptosystems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Performance and Efficiency Exploration of Hardware Polynomial Multipliers for Post-Quantum Lattice-Based Cryptosystems ; volume:5 ; number:2 ; day:20 ; month:1 ; year:2024 ; pages:1-19 ; date:2.2024
SN Computer Science ; 5, Heft 2 (20.1.2024), 1-19, 2.2024
- Creator
-
Antognazza, Francesco
Barenghi, Alessandro
Pelosi, Gerardo
Susella, Ruggero
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s42979-023-02547-w
- URN
-
urn:nbn:de:101:1-2024033121360617842039
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:04 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Antognazza, Francesco
- Barenghi, Alessandro
- Pelosi, Gerardo
- Susella, Ruggero
- SpringerLink (Online service)
Other Objects (12)
High-Performance Accurate and Approximate Multipliers for FPGA-Based Hardware Accelerators
A new class of irreducible pentanomials for polynomial-based multipliers in binary fields
Racing BIKE: improved polynomial multiplication and inversion in hardware
Computing Shortest Lattice Vectors on Special Hardware
A hierarchy of polynomial time lattice basis reduction algorithms
High-order polynomial comparison and masking lattice-based encryption
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Attacking and defending masked polynomial comparison for lattice-based cryptography
High-speed masking for polynomial comparison in lattice-based KEMs
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Mixed lattice polytope theory with a view towards sparse polynomial systems
Multipliers of Change
High-Performance Accurate and Approximate Multipliers for FPGA-Based Hardware Accelerators
A new class of irreducible pentanomials for polynomial-based multipliers in binary fields
Racing BIKE: improved polynomial multiplication and inversion in hardware
Computing Shortest Lattice Vectors on Special Hardware
A hierarchy of polynomial time lattice basis reduction algorithms
High-order polynomial comparison and masking lattice-based encryption
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Attacking and defending masked polynomial comparison for lattice-based cryptography
High-speed masking for polynomial comparison in lattice-based KEMs
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Mixed lattice polytope theory with a view towards sparse polynomial systems
Multipliers of Change
High-Performance Accurate and Approximate Multipliers for FPGA-Based Hardware Accelerators
A new class of irreducible pentanomials for polynomial-based multipliers in binary fields
Racing BIKE: improved polynomial multiplication and inversion in hardware
Computing Shortest Lattice Vectors on Special Hardware
A hierarchy of polynomial time lattice basis reduction algorithms
High-order polynomial comparison and masking lattice-based encryption
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Attacking and defending masked polynomial comparison for lattice-based cryptography
High-speed masking for polynomial comparison in lattice-based KEMs
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Mixed lattice polytope theory with a view towards sparse polynomial systems