version 1.72, 2008/06/11 23:51:57 |
version 1.73, 2008/06/12 00:13:13 |
|
|
* Graphs are not unambiguous, because circles in graphs can be |
* Graphs are not unambiguous, because circles in graphs can be |
* walked in either direction. |
* walked in either direction. |
*/ |
*/ |
#define FLDSIZE_Y 8 |
#define FLDSIZE_Y (8 + 1) |
#define FLDSIZE_X (FLDSIZE_Y * 2) |
#define FLDSIZE_X (8 * 2 + 1) |
static char * |
static char * |
key_fingerprint_randomart(u_char *dgst_raw, u_int dgst_raw_len) |
key_fingerprint_randomart(u_char *dgst_raw, u_int dgst_raw_len) |
{ |
{ |
|
|
* Chars to be used after each other every time the worm |
* Chars to be used after each other every time the worm |
* intersects with itself. Matter of taste. |
* intersects with itself. Matter of taste. |
*/ |
*/ |
char *augmentation_string = " .o+=*BOX@%&#/^"; |
char *augmentation_string = " .o+=*BOX@%&#/^S"; |
char *retval, *p; |
char *retval, *p; |
u_char field[FLDSIZE_X][FLDSIZE_Y]; |
u_char field[FLDSIZE_X][FLDSIZE_Y]; |
u_int i, b; |
u_int i, b; |
|
|
memset(field, 0, FLDSIZE_X * FLDSIZE_Y * sizeof(char)); |
memset(field, 0, FLDSIZE_X * FLDSIZE_Y * sizeof(char)); |
x = FLDSIZE_X / 2; |
x = FLDSIZE_X / 2; |
y = FLDSIZE_Y / 2; |
y = FLDSIZE_Y / 2; |
field[x][y] = 1; |
|
|
|
/* process raw key */ |
/* process raw key */ |
for (i = 0; i < dgst_raw_len; i++) { |
for (i = 0; i < dgst_raw_len; i++) { |
|
|
input = input >> 2; |
input = input >> 2; |
} |
} |
} |
} |
|
field[FLDSIZE_X / 2][FLDSIZE_Y / 2] = len; |
|
|
/* fill in retval */ |
/* fill in retval */ |
p = retval; |
p = retval; |