- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Analysis and comparison of table-based arithmetic to boolean masking ; volume:2021 ; number:3 ; pages:275-297
IACR transactions on cryptographic hardware and embedded systems ; 2021, Heft 3, 275-297
- Classification
-
Informatik
- Creator
-
Van Beirendonck, Michiel
D’Anvers, Jan-Pieter
Verbauwhede, Ingrid
- DOI
-
10.46586/tches.v2021.i3.275-297
- URN
-
urn:nbn:de:hbz:294-TCHES-1905
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 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
- Van Beirendonck, Michiel
- D’Anvers, Jan-Pieter
- Verbauwhede, Ingrid
Other Objects (12)
Improved high-order conversion from Boolean to arithmetic masking
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Boolean masking for arithmetic additions at arbitrary order in hardware
Bitslicing arithmetic/Boolean masking conversions for fun and profit : with application to lattice-based KEMs
A Code-Based ISE to Protect Boolean Masking in Software
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
ModuloNET: neural networks meet modular arithmetic for efficient hardware masking
Efficient Table-Based Masking with Pre-processing
Higher-order lookup table masking in essentially constant memory
Comparison of Masking Algorithms for Sentinel-2 Imagery
On the Approximation of Arithmetic Functions and Logic Synthesis of Approximate Very Large Boolean Networks
High-order polynomial comparison and masking lattice-based encryption
Improved high-order conversion from Boolean to arithmetic masking
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Boolean masking for arithmetic additions at arbitrary order in hardware
Bitslicing arithmetic/Boolean masking conversions for fun and profit : with application to lattice-based KEMs
A Code-Based ISE to Protect Boolean Masking in Software
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
ModuloNET: neural networks meet modular arithmetic for efficient hardware masking
Efficient Table-Based Masking with Pre-processing
Higher-order lookup table masking in essentially constant memory
Comparison of Masking Algorithms for Sentinel-2 Imagery
On the Approximation of Arithmetic Functions and Logic Synthesis of Approximate Very Large Boolean Networks
High-order polynomial comparison and masking lattice-based encryption
Improved high-order conversion from Boolean to arithmetic masking
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Boolean masking for arithmetic additions at arbitrary order in hardware
Bitslicing arithmetic/Boolean masking conversions for fun and profit : with application to lattice-based KEMs
A Code-Based ISE to Protect Boolean Masking in Software
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
ModuloNET: neural networks meet modular arithmetic for efficient hardware masking
Efficient Table-Based Masking with Pre-processing
Higher-order lookup table masking in essentially constant memory
Comparison of Masking Algorithms for Sentinel-2 Imagery
On the Approximation of Arithmetic Functions and Logic Synthesis of Approximate Very Large Boolean Networks