- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Applied sciences, 12, 5, Article 2274, S. 2274-1-2274-14
- Ereignis
-
Veröffentlichung
- (wo)
-
Bochum
- (wer)
-
Ruhr-Universität Bochum
- (wann)
-
2022
- Urheber
-
Bache, Florian
Güneysu, Tim
- URN
-
urn:nbn:de:hbz:294-90543
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 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
- Bache, Florian
- Güneysu, Tim
- Ruhr-Universität Bochum
Entstanden
- 2022
Ähnliche Objekte (12)
Improved high-order conversion from Boolean to arithmetic masking
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Analysis and comparison of table-based arithmetic to boolean masking
Bitslicing arithmetic/Boolean masking conversions for fun and profit : with application to lattice-based KEMs
Embedding Arbitrary Boolean Circuits into Fungal Automata
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
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
On the Approximation of Arithmetic Functions and Logic Synthesis of Approximate Very Large Boolean Networks
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems
Boolean algebras
Improved high-order conversion from Boolean to arithmetic masking
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Analysis and comparison of table-based arithmetic to boolean masking
Bitslicing arithmetic/Boolean masking conversions for fun and profit : with application to lattice-based KEMs
Embedding Arbitrary Boolean Circuits into Fungal Automata
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
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
On the Approximation of Arithmetic Functions and Logic Synthesis of Approximate Very Large Boolean Networks
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems
Boolean algebras
Improved high-order conversion from Boolean to arithmetic masking
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Analysis and comparison of table-based arithmetic to boolean masking
Bitslicing arithmetic/Boolean masking conversions for fun and profit : with application to lattice-based KEMs
Embedding Arbitrary Boolean Circuits into Fungal Automata
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
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
On the Approximation of Arithmetic Functions and Logic Synthesis of Approximate Very Large Boolean Networks
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems