Optimal First-Order Masking with Linear and Non-linear Bijections

Maghrebi, Houssem; Carlet, Claude; Guilley, Sylvain; Danger, Jean‐Luc

doi:10.1007/978-3-642-31410-0_22

Cited by 14 publications

(24 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Section 3.4 for some [32,16,81 codes we determine the maximum dimension sub code with respect to d = 12 to have dimension 11. A brute-force subcode search (such as the sub codes traversing algorithm in [45] [20,20,20,20,24,24,24,24,32,32]' [20,20,20,20,20,20,20,24,28,36].…”

Section: Repeat This Until D(cmentioning

confidence: 99%

“…Suppose a [48,17,16] self-complementary subcode C exists. The possible non-zero weights of Care 16,20,24,28,32,48. Define the following matrices: a3,a4,a5,a6, b,20,20,20, 20, 24,24, 24,24,48] where ai E {12, 16} and b E {12, 16, 20}.…”

Section: A [Ao(c 46 ) a 20 (C 46 ) A 24 (C 46 ) A 28 (C 46 )]Tmentioning

confidence: 99%

“…G [28,4,16j 0100010001001101001110101010 0010011101110111001111001100 G [28,4,16] 0100010001001011010100110110 0010011101110111001111001100 0001000100011110010101010011 G [28,4,16] 0101001100111010000010011010 0011000000110011001100110011 0000011001011010010110101100…”

mentioning

confidence: 99%

“…Let C be any [28,7,12] self-complementary code. Since the [28,3,16] subcode is optimal, in light of Lemma 2.8, we determine ODpdic[Ch = 16.…”

mentioning

confidence: 99%

“…Since the [28,3,16] subcode is optimal, in light of Lemma 2.8, we determine ODpdic[Ch = 16. As a [28,3,16] subcode cannot contain the all-one vector, we determine the ODP in dictionary order: 12,12,12,12,16,16,16].…”

mentioning

confidence: 99%

See 4 more Smart Citations