Optimized linear complementary codes implementation for hardware trojan prevention

Carlet, Claude; Daif, Abderrahman; Danger, Jean‐Luc; Guilley, Sylvain; Najm, Zakaria; Ngo, Xuan Thuy; Porteboeuf, Tliibault; Tavernier, Cédric

doi:10.1109/ecctd.2015.7300075

Cited by 13 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let U = {x ∈ F s 2 : wt(x) ≥ 2} and let V = {0}. Let f be the Boolean function defined in (5), where g ≡ 1, φ is an injection from F s 2 \U to F t 2 \V , and φ(x) = 0 for any x ∈ U. II) when s is odd (resp.…”

Section: A Some Minimal Binary Linear Codes From Known Minimal Binary...mentioning

confidence: 99%

See 1 more Smart Citation

Minimal linear codes from characteristic functions

Mesnager¹,

Qi²,

Ru³

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

Section: A Some Minimal Binary Linear Codes From Known Minimal Binary...mentioning

confidence: 99%

“…Remark 5: Note that E 1 and E 2 can be identified as two linear codes over F p . By E 1 + E 2 = F q and E 1 ∩ E 2 = {0}, (E 1 , E 2 ) is a linear complementary pair (LCP) of codes over F p [5], [6]. We can take two subspaces E 1 and E 2 of F q , where E 2 = E ⊥…”

Section: B Minimal Linear Codes From Characteristic Functions Corresp...mentioning

confidence: 99%

Minimal linear codes from characteristic functions

Mesnager¹,

Qi²,

Ru³

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

“…LCD codes are also useful in information protection from side-channel attacks and hardware Trojan horses (see [4], [5], [8], [10], [16], and [17]). In [9], LCD codes have been applied in constructing good entanglement-assisted quantum error correcting codes.…”

Section: Introductionmentioning

confidence: 99%

Characterization and enumeration of complementary dual abelian codes

Boripan

Jitman

Udomkavanich

2017

J. Appl. Math. Comput.

View full text Add to dashboard Cite

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary dual in a group algebra F p ν [G] has been studied under both the Euclidean and Hermitian inner products, where p is a prime, ν is a positive integer, and G is an arbitrary finite abelian group. Based on the discrete Fourier transform decomposition for semi-simple group algebras and properties of ideas in local group algebras, the characterization of such codes have been given. Subsequently, the number of complementary dual abelian codes in F p ν [G] has been shown to be independent of the Sylow p-subgroup of G and it has been completely determined for every finite abelian group G. In some cases, a simplified formula for the enumeration has been provided as well. The known results for cyclic complementary dual codes can be viewed as corollaries.

show abstract

“…This need is general in cryptography, and has specific applications when thwarting Hardware Trojan Horses (HTH) [35,34,11]. Indeed, the activation part of a HTH is impeded by masking, whereas the payload part is caught red-handed by a detection code.…”

Section: Masking and Faults Detectionmentioning

confidence: 99%

Codes for Side-Channel Attacks and Protections

Guilley

Heuser

Rioul

2017

Codes, Cryptology and Information Security

Self Cite

View full text Add to dashboard Cite

Abstract. This article revisits side-channel analysis from the standpoint of coding theory. On the one hand, the attacker is shown to apply an optimal decoding algorithm in order to recover the secret key from the analysis of the side-channel. On the other hand, the side-channel protections are presented as a coding problem where the information is mixed with randomness to weaken as much as possible the sensitive information leaked into the side-channel. Therefore, the field of side-channel analysis is viewed as a struggle between a coder and a decoder. In this paper, we focus on the main results obtained through this analysis. In terms of attacks, we discuss optimal strategy in various practical contexts, such as type of noise, dimensionality of the leakage and of the model, etc. Regarding countermeasures, we give a formal analysis of some masking schemes, including enhancements based on codes contributed via fruitful collaborations with Claude Carlet.

show abstract

Optimized linear complementary codes implementation for hardware trojan prevention

Cited by 13 publications

References 4 publications

Minimal linear codes from characteristic functions

Minimal linear codes from characteristic functions

Characterization and enumeration of complementary dual abelian codes

Codes for Side-Channel Attacks and Protections

Contact Info

Product

Resources

About