- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
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
- Klassifikation
-
Informatik
- Urheber
-
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
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:25 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Van Beirendonck, Michiel
- D’Anvers, Jan-Pieter
- Verbauwhede, Ingrid
Ähnliche Objekte (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