|
|
A131630
|
|
Consider the AES (or Rijndael) S-boxes and concatenate i and sbox[i] for all i. Then a(n) is the number of these pairs at Hamming distance n from 0, sbox[0].
|
|
1
|
|
|
1, 0, 0, 3, 7, 18, 41, 44, 34, 33, 40, 26, 6, 2, 1, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
The S-box takes as input one byte and outputs one byte. So we are concatenating an 8-bit i with the 8-bit output of sbox[i].
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|