38 lines
1.4 KiB
Groff
38 lines
1.4 KiB
Groff
.TH "aeskeyfind" "1" "2020-02-28" "User Commands" "User Commands"
|
|
.SH "NAME"
|
|
aeskeyfind \- Locates 128-bit and 256-bit AES keys in a captured memory image.
|
|
.SH SYNOPSIS
|
|
.B aesfix
|
|
SCHEDULE-FILE
|
|
.SH DESCRIPTION
|
|
SCHEDULE-FILE
|
|
The aesfix tool corrects bit errors in an AES key schedule read from the specified hex-encoded file.
|
|
.PP
|
|
This program is limited to AES-128 key schedules, and it can only correct unidirectional 1->0
|
|
bit errors. For the most part it has been optimized for readability
|
|
rather than performance.
|
|
.PP
|
|
The algorithm has these major steps:
|
|
.PP
|
|
1. Given a key schedule containing bit errors, divide the schedule
|
|
into four 7-bit "slices", each of which should be uniquely
|
|
determined by its first four bits.
|
|
.PP
|
|
2. For increasing number of errors w to the key (round 0) bytes:
|
|
.PP
|
|
a. List possible "decoded" values that could have suffered w
|
|
or fewer unidirectional errors to form the slice.
|
|
.PP
|
|
b. Consider all the key schedules generated by combinations of
|
|
these decodings. If one could have decayed into the key
|
|
schedule that we're trying to repair, output it and stop.
|
|
.SH AUTHOR
|
|
.TP
|
|
aesfix was written by Nadia Heninger and and J. Alex Halderman.
|
|
.SH "SEE ALSO"
|
|
\fBaeskeyfind\fR(1),
|
|
\fBbiosmemimage\fR(1),
|
|
\fBrsakeyfind\fR(1)
|
|
.PP
|
|
.UR "https://citp.princeton.edu/our-work/memory/"
|
|
.BR "https://citp.princeton.edu/our-work/memory/"
|