|
Search: id:A131630
|
|
|
| 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]. |
|
+0
2
|
|
| 1, 0, 0, 3, 7, 18, 41, 44, 34, 33, 40, 26, 6, 2, 1, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
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
|
J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum and Edward W. Felten, Lest We Remember: Cold Boot Attacks on Encryption Keys, 2008.
Wikipedia, Rijndael S-box
|
|
EXAMPLE
|
0: 1
1: 0
2: 0
3: 3
4: 7
5: 18
6: 41
7: 44
8: 34
9: 33
10: 40
11: 26
12: 6
13: 2
14: 1
15: 0
16: 0
|
|
CROSSREFS
|
Cf. A131620.
Sequence in context: A074587 A076700 A026533 this_sequence A036884 A102291 A034691
Adjacent sequences: A131627 A131628 A131629 this_sequence A131631 A131632 A131633
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
Nadia Heninger (nadiah(AT)cs.princeton.edu), May 28 2008
|
|
|
Search completed in 0.002 seconds
|
