Results 1 to 10 of about 7,603 (154)

Triplex: an Efficient and One-Pass Leakage-Resistant Mode of Operation

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2022
This paper introduces and analyzes Triplex, a leakage-resistant mode of operation based on Tweakable Block Ciphers (TBCs) with 2n-bit tweaks. Triplex enjoys beyond-birthday ciphertext integrity in the presence of encryption and decryption leakage in a ...
Yaobin Shen   +4 more
doaj   +3 more sources

Exploring Crypto-Physical Dark Matter and Learning with Physical Rounding

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2020
State-of-the-art re-keying schemes can be viewed as a tradeoff between efficient but heuristic solutions based on binary field multiplications, that are only secure if implemented with a sufficient amount of noise, and formal but more expensive solutions
Sébastien Duval   +3 more
doaj   +3 more sources

Improved Leakage-Resistant Authenticated Encryption based on Hardware AES Coprocessors

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2021
We revisit Unterstein et al.’s leakage-resilient authenticated encryption scheme from CHES 2020. Its main goal is to enable secure software updates by leveraging unprotected (e.g., AES, SHA256) coprocessors available on low-end microcontrollers.
Olivier Bronchain   +3 more
doaj   +1 more source

When Bad News Become Good News

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2022
Hard physical learning problems have been introduced as an alternative option to implement cryptosystems based on hard learning problems. Their high-level idea is to use inexact computing to generate erroneous computations directly, rather than to first
Davide Bellizia   +4 more
doaj   +3 more sources

Learning Parity with Physical Noise: Imperfections, Reductions and FPGA Prototype

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2021
Hard learning problems are important building blocks for the design of various cryptographic functionalities such as authentication protocols and post-quantum public key encryption.
Davide Bellizia   +6 more
doaj   +1 more source

Information Bounds and Convergence Rates for Side-Channel Security Evaluators

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2023
Current side-channel evaluation methodologies exhibit a gap between inefficient tools offering strong theoretical guarantees and efficient tools only offering heuristic (sometimes case-specific) guarantees.
Loïc Masure   +3 more
doaj   +1 more source

Bitslicing Arithmetic/Boolean Masking Conversions for Fun and Profit

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2022
The performance of higher-order masked implementations of lattice-based based key encapsulation mechanisms (KEM) is currently limited by the costly conversions between arithmetic and Boolean masking.
Olivier Bronchain, Gaëtan Cassiers
doaj   +3 more sources

Provably Secure Hardware Masking in the Transition- and Glitch-Robust Probing Model: Better Safe than Sorry

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2021
There exists many masking schemes to protect implementations of cryptographic operations against side-channel attacks. It is common practice to analyze the security of these schemes in the probing model, or its variant which takes into account physical ...
Gaëtan Cassiers   +1 more
doaj   +1 more source

Efficient and Private Computations with Code-Based Masking

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2020
Code-based masking is a very general type of masking scheme that covers Boolean masking, inner product masking, direct sum masking, and so on. The merits of the generalization are twofold.
Weijia Wang   +3 more
doaj   +1 more source

Prime-Field Masking in Hardware and its Soundness against Low-Noise SCA Attacks

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2023
A recent study suggests that arithmetic masking in prime fields leads to stronger security guarantees against passive physical adversaries than Boolean masking.
Gaëtan Cassiers   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy