A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Sound Method for Switching between Boolean and Arithmetic Masking
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
There is thus a need for a method to convert back and forth between boolean masking and arithmetic masking. ...
However, for algorithms that combine boolean and arithmetic functions, such as IDEA or several of the AES candidates, two different kinds of masking have to be used. ...
There is thus a need for a method to convert back and forth between boolean masking and arithmetic masking. ...
doi:10.1007/3-540-44709-1_2
fatcat:cev3n2hybjccfdod744b3dflui
Secure Multiple SBoxes Implementation with Arithmetically Masked Input
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A method using state of the art algorithms would be to first perform an arithmetic to boolean mask conversion before independently accessing the N SBoxes. ...
To this end, masking is a widely used protection technique. Propagating the masks through non-linear functions is a necessary task to achieve a sound and secure masked implementation. ...
In 2004, Neiße and Pulkus proposed a sound and efficient method to perform AMtoBM conversion in [17] . ...
doi:10.1007/978-3-642-37288-9_7
fatcat:pahgbe7eh5hhfggrkv4ds7q4gu
Majority-Inverter Graph: A New Paradigm for Logic Optimization
2016
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As a complement to MIG algebraic optimization, we develop powerful Boolean methods exploiting global properties of MIGs, such as bit-error masking. ...
MIG algebraic and Boolean methods together attain very high optimization quality. ...
We developed algebraic and Boolean optimization techniques for MIGs and we embedded them into a tool, called MIGhty. ...
doi:10.1109/tcad.2015.2488484
fatcat:fsd6s7wrdzfhrgqzpwepdbvwru
ModuloNET: Neural Networks Meet Modular Arithmetic for Efficient Hardware Masking
2021
Transactions on Cryptographic Hardware and Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The key idea is to use modular arithmetic in neural networks and then efficiently realize masking, in either Boolean or arithmetic fashion, depending on the type of neural network layers. ...
There is a critical need to efficiently and securely transform those defenses from cryptography such as masking to ML frameworks. ...
We are grateful to the Cloudlab [DRM + 19] team for compute support and to the W&B [Bie20] team for logging and visualisation support. ...
doi:10.46586/tches.v2022.i1.506-556
fatcat:uz45ogvuzvfvjpjgtxmdbbgyq4
Efficient Masking of ARX-Based Block Ciphers Using Carry-Save Addition on Boolean Shares
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Applying masking to a cipher that involves both arithmetic and Boolean operations requires a conversion between arithmetic and Boolean masks. ...
We integrated both addition techniques into a masked implementation of the block cipher Speck and found that the CSA-based variant clearly outperforms its Kogge-Stone counterpart by a factor of 1.70 for ...
Goubin was the first to describe secure algorithms for conversion between arithmetic and Boolean masks in [9] . ...
doi:10.1007/978-3-319-69659-1_3
fatcat:uweahyajcjhdlmy2daiewhacs4
A Masked Ring-LWE Implementation
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The output of the ring-LWE decryption are Boolean shares suitable for derivation of a symmetric key. ...
We have implemented a hardware architecture of the masked ring-LWE processor on a Virtex-II FPGA, and have performed side channel analysis to confirm the soundness of our approach. ...
Oscar Reparaz is funded by a PhD fellowship of the Fund for Scientific Research -Flanders (FWO). Sujoy Sinha Roy was supported by Erasmus Mundus PhD Scholarship. ...
doi:10.1007/978-3-662-48324-4_34
fatcat:o3dq35tsb5hf3ibzarhva6zj2m
MaskedNet: The First Hardware Inference Engine Aiming Power Side-Channel Protection
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The resulting design uses novel masked components such as masked adder trees for fully-connected layers and masked Rectifier Linear Units for activation functions. ...
First, it shows DPA attacks during inference to extract the secret model parameters such as weights and biases of a neural network. ...
ACKNOWLEDGEMENTS We thank the anonymous reviewers of HOST for their valuable feedback and to Itamar Levi for helpful discussions. ...
arXiv:1910.13063v3
fatcat:iand6q5qb5g2lpgtbsh6bnlmfy
Masking ring-LWE
2016
Journal of Cryptographic Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Oscar Reparaz is funded by a PhD fellowship of the Fund for Scientific Research -Flanders (FWO). Sujoy Sinha Roy was supported by Erasmus Mundus PhD Scholarship. ...
The authors would like to thank the CHES 2015 reviewers for their valuable comments. ...
There the authors resort to a generic masking method, namely masked tables, to perform the decoding. ...
doi:10.1007/s13389-016-0126-5
fatcat:se3otguhwjabbg5gzpqvmecs3i
Higher-Order Threshold Implementation of the AES S-Box
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a threshold implementation of the Advanced Encryption Standard's S-box which is secure against first-and second-order power analysis attacks. ...
The design requires an area of 7849 Gate Equivalents and 126 bits of randomness per S-box execution. ...
The wide usage of these devices demands strong yet practical methods to mitigate this problem. A sound and popular such method is masking [8, 13] . ...
doi:10.1007/978-3-319-31271-2_16
fatcat:3tv7et4p6zg5fjscgsttlm23lu
Higher-Order Threshold Implementation Of The Aes S-Box
2015
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a threshold implementation of the Advanced Encryption Standard's S-box which is secure against first- and second-order power analysis attacks. ...
The design requires an area of 7849 Gate Equivalents and 126 bits of randomness per S-box execution. ...
The wide usage of these devices demands strong yet practical methods to mitigate this problem. A sound and popular such method is masking [8, 13] . ...
doi:10.5281/zenodo.58086
fatcat:2ovqn6rme5fk7e4coxg7m5ylhu
Abstracts of Current Computer Literature
1970
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Determination and Classification of Prime Implicants of Switching Functions-see 7753. Minimization of Boolean Functions Using Implication Masks-see 7728. ...
Masks 7728
Simplification of the Covering Problem with
Applications to Boolean Expressions 7730
Determination of the Complete Boolean
Connection Matrix of a Combinational
Switching Network 7731 ...
doi:10.1109/t-c.1970.223012
fatcat:r5fw2k62rfhphcyztzcnhldnry
Page 9826 of Mathematical Reviews Vol. , Issue 2003m
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{For the entire collection see MR 2003f:11004. }
2003m:94064 94A60 Goubin, Louis A sound method for switching between Boolean and arithmetic masking. ...
In an attempt to reduce the resulting memory and execution time overhead, a general method has recently been proposed, consisting in ‘masking’ all the intermediate data. ...
Advancing in-memory Arithmetic Based on CMOS-integrable Memristive Crossbar Structures
2021
PROOF
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Here we report on the development of a new concept for in-memory adders, using XOR functionality. ...
Exploited memristive crossbar structures are based on memristive complementary resistive switches, e.g. TaOx, and BiFeO3. ...
Boolean logic functions can be used to make binary arithmetics, namely adders, subtractors, multipliers, and dividers. ...
doi:10.37394/232020.2021.1.12
fatcat:72pvhnadb5crvfaenipalhsr74
Higher-Order Masked Ciphertext Comparison for Lattice-Based Cryptography
2022
Transactions on Cryptographic Hardware and Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For instance, the hash-based method by Oder et al. is limited to first-order masking, a higher-order method by Bache et al. was shown to be flawed, and a very recent higher-order technique by Bos et al ...
Our new method is 4.2x, resp. 7.5x, faster than the method of Bos et al. for a 2nd, resp. 3rd, -order masking on the ARM Cortex-M4, and unlike the method of Bache et al., the new technique takes ciphertext ...
We would also like to thank Thomas Pöppelmann for the discussions on how to optimize the masked comparison operation and Julius Hermelink for his support on integrating his key-recovery algorithm in our ...
doi:10.46586/tches.v2022.i2.115-139
fatcat:juolpuan2nhkbn6d5ifjks5hv4
Sierra
2014
Proceedings of the 2014 Workshop on Workshop on programming models for SIMD/Vector processing - WPMVP '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In particular, programmers are often unwilling to port their working C++ code to a new programming language. In this paper we present Sierra: a SIMD extension for C++. ...
It combines the full power of C++ with an intuitive and effective way to address SIMD hardware. With Sierra, the programmer can write efficient, portable and maintainable code. ...
The statement translates to the following pattern:
Virtual Method Calls for Vectorial this Pointers In the following example the compiler has to invoke four virtual methods:
Discussion and Related ...
doi:10.1145/2568058.2568062
dblp:conf/ppopp/LeissaHH14
fatcat:6dsz7y7xk5g6ffive6cym4erv4
« Previous
Showing results 1 — 15 out of 672 results