References of "IACR Transactions on Cryptographic Hardware and Embedded Systems"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailHigh-order masking of NTRU
Coron, Jean-Sébastien UL; Gérard, François; Trannoy, Matthias et al

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2023), 2023(2), 180--211

Detailed reference viewed: 38 (1 UL)
Full Text
Peer Reviewed
See detailHigh-order Polynomial Comparison and Masking Lattice-based Encryption
Coron, Jean-Sébastien UL; Gérard, François; Montoya, Simon et al

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2023), 2023(1), 153--192

Detailed reference viewed: 37 (1 UL)
Full Text
Peer Reviewed
See detailRISC-V Instruction Set Extensions for Lightweight Symmetric Cryptography
Cheng, Hao UL; Groszschädl, Johann UL; Marshall, Ben et al

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2022, November), 2023(1), 193-237

The NIST LightWeight Cryptography (LWC) selection process aims to standardise cryptographic functionality which is suitable for resource-constrained devices. Since the outcome is likely to have ... [more ▼]

The NIST LightWeight Cryptography (LWC) selection process aims to standardise cryptographic functionality which is suitable for resource-constrained devices. Since the outcome is likely to have significant, long-lived impact, careful evaluation of each submission with respect to metrics explicitly outlined in the call is imperative. Beyond the robustness of submissions against cryptanalytic attack, metrics related to their implementation (e.g., execution latency and memory footprint) form an important example. Aiming to provide evidence allowing richer evaluation with respect to such metrics, this paper presents the design, implementation, and evaluation of one separate Instruction Set Extension (ISE) for each of the 10 LWC final round submissions, namely Ascon, Elephant, GIFT-COFB, Grain-128AEADv2, ISAP, PHOTON-Beetle, Romulus, Sparkle, TinyJAMBU, and Xoodyak; although we base the work on use of RISC-V, we argue that it provides more general insight. [less ▲]

Detailed reference viewed: 72 (18 UL)
Full Text
Peer Reviewed
See detailWhen Bad News Become Good News Towards Usable Instances of Learning with Physical Errors
Bellizia, Davide; Hoffmann, Clément; Kamel, Dina et al

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2022), 2022(4), 1--24

Detailed reference viewed: 32 (2 UL)
Full Text
Peer Reviewed
See detailHigh-order Table-based Conversion Algorithms and Masking Lattice-based Encryption
Coron, Jean-Sébastien UL; Gerard, François UL; Montoya, Simon et al

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2022)

Detailed reference viewed: 17 (2 UL)
Full Text
Peer Reviewed
See detailDefeating State-of-the-Art White-Box Countermeasures with Advanced Gray-Box Attacks
Goubin, Louis; Rivain, Matthieu UL; Wang, Junwei UL

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2020), 2020(3), 454482

The goal of white-box cryptography is to protect secret keys embedded in a cryptographic software deployed in an untrusted environment. In this article, we revisit state-of-the-art countermeasures ... [more ▼]

The goal of white-box cryptography is to protect secret keys embedded in a cryptographic software deployed in an untrusted environment. In this article, we revisit state-of-the-art countermeasures employed in white-box cryptography, and we discuss possible ways to combine them. Then we analyze the different gray-box attack paths and study their performances in terms of required traces and computation time. Afterward, we propose a new paradigm for the gray-box attack against white-box cryptography, which exploits the data-dependency of the target implementation. We demonstrate that our approach provides substantial complexity improvements over the existing attacks. Finally, we showcase this new technique by breaking the three winning AES-128 white-box implementations from WhibOx 2019 white-box cryptography competition. [less ▲]

Detailed reference viewed: 172 (1 UL)
Full Text
Peer Reviewed
See detailAnalysis and Improvement of Differential Computation Attacks against Internally-Encoded White-Box Implementations
Rivain, Matthieu UL; Wang, Junwei UL

in IACR Transactions on Cryptographic Hardware and Embedded Systems (2019), 2019(2), 225-255

White-box cryptography is the last security barrier for a cryptographic software implementation deployed in an untrusted environment. The principle of internal encodings is a commonly used white-box ... [more ▼]

White-box cryptography is the last security barrier for a cryptographic software implementation deployed in an untrusted environment. The principle of internal encodings is a commonly used white-box technique to protect block cipher implementations. It consists in representing an implementation as a network of look-up tables which are then encoded using randomly generated bijections (the internal encodings). When this approach is implemented based on nibble (i.e. 4-bit wide) encodings, the protected implementation has been shown to be vulnerable to differential computation analysis (DCA). The latter is essentially an adaptation of differential power analysis techniques to computation traces consisting of runtime information, e.g., memory accesses, of the target software. In order to thwart DCA, it has then been suggested to use wider encodings, and in particular byte encodings, at least to protect the outer rounds of the block cipher which are the prime targets of DCA. In this work, we provide an in-depth analysis of when and why DCA works. We pinpoint the properties of the target variables and the encodings that make the attack (in)feasible. In particular, we show that DCA can break encodings wider than 4-bit, such as byte encodings. Additionally, we propose new DCA-like attacks inspired from side-channel analysis techniques. Specifically, we describe a collision attack particularly effective against the internal encoding countermeasure. We also investigate mutual information analysis (MIA) which naturally applies in this context. Compared to the original DCA, these attacks are also passive and they require very limited knowledge of the attacked implementation, but they achieve significant improvements in terms of trace complexity. All the analyses of our work are experimentally backed up with various attack simulation results. We also verified the practicability of our analyses and attack techniques against a publicly available white-box AES implementation protected with byte encodings –which DCA has failed to break before– and against a “masked” white-box AES implementation –which intends to resist DCA. [less ▲]

Detailed reference viewed: 65 (1 UL)