TestResults* myersDiffbyLineNoWhite ( const std::string & student_file, const std::string & expected_file) {
vectorOfWords text_a = stringToWords( student_file );
vectorOfWords text_b = stringToWords( expected_file );
Difference* diff = ses( &text_a, &text_b, false );
diff->type = ByLineByWord;
return diff;
}
TestResults* myersDiffbyLinebyCharExtraStudentOutputOk ( const std::string & student_file, const std::string & expected_file) {
#if 0
//from nowhite
vectorOfWords text_a = stringToWords( student_file );
vectorOfWords text_b = stringToWords( expected_file );
Difference* diff = ses( &text_a, &text_b, true, extraStudentOutputOk );
diff->type = ByLineByWord;
return diff;
#else
std::cout << "MYERS DIFF EXTRA STUDENT OUTPUT" << std::endl;
vectorOfLines text_a = stringToLines( student_file );
vectorOfLines text_b = stringToLines( expected_file );
bool extraStudentOutputOk = true;
Difference* diff = ses( &text_a, &text_b, true, extraStudentOutputOk );
diff->type = ByLineByChar;
std::cout << "end of MYERS DIFF EXTRA STUDENT OUTPUT" << std::endl;
return diff;
#endif
}
int main(void) {
int i, j, bitsPerShortKey, result;
BLOCK plainText, cipherText, PT_9998;
KEY binaryKey;
char asciiKey[HEX_DIGITS_PER_KEY+1];
keyInstance key;
cipherInstance cipher;
/* The hack that remembers PT_9998 only works if... */
assert(BITS_PER_KEY <= 2*BITS_PER_BLOCK);
/* ...otherwise we'd have to remember more than just PT_9998. */
printHeader("ecb_d_m", "Electronic Codebook (ECB) Mode - DECRYPTION",
"Monte Carlo Test");
for(bitsPerShortKey=BITS_PER_SHORTEST_KEY; bitsPerShortKey<=BITS_PER_KEY;
bitsPerShortKey+=BITS_PER_KEY_STEP) {
result = stringToWords("00000000000000000000000000000000", cipherText,
WORDS_PER_BLOCK);
if (result != TRUE) goto error;
printf("KEYSIZE=%d\n\n", bitsPerShortKey);
/* Construct (backwards) an ascii key of all 0s, of length
bitsPerShortKey bits. */
i=bitsPerShortKey/BITS_PER_HEX_DIGIT;
asciiKey[i] = 0; /* terminating null */
for (i--; i >=0; i--) {
asciiKey[i] = '0';
}
result = cipherInit(&cipher, MODE_ECB, 0);
if (result != TRUE) goto error;
for(i=0; i<OUTER_LOOP_MAX; i++) {
result = makeKey(&key, DIR_DECRYPT, bitsPerShortKey, asciiKey);
if (result != TRUE) goto error;
/* NIST SPEC: Record i, KEY_i, CT_0 */
printf("I=%d\n", i);
render("KEY=", key.userKey, bitsPerShortKey/BITS_PER_WORD);
render("CT=", cipherText, WORDS_PER_BLOCK);
for (j=0; j<INNER_LOOP_MAX; j++) {
/* NIST SPEC: IB_j=CT_j */
/* Implicit (no IB var used) */
/* encrypt */
result = blockDecrypt(&cipher, &key, (BYTE*) cipherText,
BITS_PER_BLOCK, (BYTE*) plainText);
if (result < 0) {
goto error;
} else if (result != BITS_PER_BLOCK) {
result = BAD_NUMBER_OF_BITS_PROCESSED;
goto error;
}
/* NIST SPEC: CT_j+1 = PT_j */
memcpy(cipherText, plainText, BYTES_PER_BLOCK);
if (j == INNER_LOOP_MAX-2) {
memcpy(PT_9998, plainText, BYTES_PER_BLOCK);
}
}
/* NIST SPEC: Record PT_j */
render("PT=", cipherText, WORDS_PER_BLOCK);
printf("\n");
/* NIST SPEC: KEY_i+1 = KEY_i xor last n bits of PT, where n=key size */
/* First, juxtapose PT_9999 and PT_9998 into binaryKey; */
memcpy(binaryKey, PT_9998, BYTES_PER_BLOCK);
memcpy(&binaryKey[WORDS_PER_BLOCK], plainText, BYTES_PER_BLOCK);
memmove(binaryKey,
&binaryKey[(BITS_PER_KEY-bitsPerShortKey)/BITS_PER_WORD],
bitsPerShortKey/BITS_PER_BYTE);
/* Then, xor this stuff with the previously used key. */
for (j=0; j<bitsPerShortKey/BITS_PER_WORD; j++) {
binaryKey[j] ^= key.userKey[j];
}
/* NB: the NIST API does not provide callers with a way to specify a
new key in binary format, so we have to go through the rigmarole
of computing the new key in binary and converting it to ascii so
that we can feed it to makeKey which will internally reconvert it
back to binary--yechh. Note that just poking a new binary key in
key.userKey won't work, as we need to invoke the routine that
makes the subkeys. */
wordsToString(binaryKey,
bitsPerShortKey/BITS_PER_WORD, asciiKey);
result = makeKey(&key, DIR_DECRYPT, bitsPerShortKey, asciiKey);
if (result != TRUE) goto error;
/* NIST SPEC: CT_0 = PT_9999 */
memcpy(cipherText, plainText, BYTES_PER_BLOCK);
}
printf("==========\n\n");
}
exit(0);
error:
printf("Error %d (sorry, see aes.h to see what this means)\n", result);
exit(result);
}
int main(void) {
int bitsPerShortKey, result;
BLOCK T, plainText, cipherText, recoveredPlainText, recoveredCipherText;
char asciiKey[HEX_DIGITS_PER_KEY+1];
char asciiT[HEX_DIGITS_PER_BLOCK+1];
keyInstance key;
cipherInstance cipher;
char* masterAsciiPattern =
"0123456789abcdeffedcba9876543210"
"00112233445566778899aabbccddeeff"
"ffeeddccbbaa99887766554433221100";
assert(strlen(masterAsciiPattern)
>= HEX_DIGITS_PER_BLOCK+HEX_DIGITS_PER_KEY);
/* ...otherwise we need to put more hex digits in it! */
printf(
"/*\n"
"\n"
"For each key size, this test program picks a key K and a\n"
"block-sized test pattern T (not all 0s: we use an asymmetric\n"
"pattern to highlight any word swaps). It then encrypts T under K\n"
"and decrypts the result, showing all the intermediate values\n"
"along the way; it then DEcrypts T under K and encrypts the\n"
"result, again showing all intermediate values.\n"
"\n"
"The intermediate values shown are: the 256-bit long key (LONG_KEY)\n"
"corresponding to the supplied key; all the subkeys of the key\n"
"schedule, both in bitslice (SK[]) and in standard (SK^[])\n"
"format, and the outputs of all the rounds (R[], or Rinv[] for\n"
"the inverse rounds while decrypting). The relevant round number\n"
"for each result appears within the square brackets.\n"
"\n"
"Note that this reference implementation, since it does not\n"
"implement the fast bitslice variant, only uses the standard keys\n"
"(SK^[]) in its rounds. However the algorithm's description\n"
"defines those in terms of the bitslice keys (SK[]), which need\n"
"to be precomputed first, so these are shown as well.\n"
"\n"
"The subkeys are all precomputed within makeKey(), since they\n"
"remain the same for all the blocks processed under the same key;\n"
"for this reason, they all appear at the beginning instead of\n"
"being interleaved with the round values.\n"
"\n"
"In keeping with the convention adopted in other NIST example\n"
"files, there is a blank line between the output of different\n"
"blocks. There are no blank lines between internal results\n"
"pertaining to the same block.\n"
"\n"
"Note also that printing of intermediate values can be turned on\n"
"or off for *any* test run (not that you'd want to do it in those\n"
"that run millions of encryptions, though...) simply by linking\n"
"the desired main program with serpent-reference-show-internals.o\n"
"instead of the regular serpent-reference.o. As you might have\n"
"guessed, you obtain the former by compiling serpent-reference.c\n"
"with -DSHOW_INTERNALS. Conversely, this same test can be run\n"
"with just the top-level results (and no intermediate printouts)\n"
"by simply linking it with serpent-reference.o. See the Makefile\n"
"for more details.\n"
"\n"
"*/\n"
"\n"
);
printHeader("ecb_iv", "Electronic Codebook (ECB) Mode",
"Intermediate Values Known Answer Tests");
strncpy(asciiT, masterAsciiPattern, HEX_DIGITS_PER_BLOCK);
asciiT[HEX_DIGITS_PER_BLOCK] = 0;
result = stringToWords(asciiT, T, WORDS_PER_BLOCK);
if (result != TRUE) goto error;
for(bitsPerShortKey=BITS_PER_SHORTEST_KEY; bitsPerShortKey<=BITS_PER_KEY;
bitsPerShortKey+=BITS_PER_KEY_STEP) {
/* make the key and set things up */
printf("KEYSIZE=%d\n\n", bitsPerShortKey);
strncpy(asciiKey, &masterAsciiPattern[HEX_DIGITS_PER_BLOCK],
bitsPerShortKey/BITS_PER_HEX_DIGIT);
asciiKey[bitsPerShortKey/BITS_PER_HEX_DIGIT] = 0;
printf("KEY=%s\n\n", asciiKey);
result = makeKey(&key, DIR_ENCRYPT, bitsPerShortKey, asciiKey);
if (result != TRUE) goto error;
printf("\n");
result = cipherInit(&cipher, MODE_ECB, 0);
if (result != TRUE) goto error;
/* encrypt T */
key.direction = DIR_ENCRYPT;
render("PT=", T, WORDS_PER_BLOCK);
result = blockEncrypt(&cipher, &key, (BYTE*) T, BITS_PER_BLOCK,
(BYTE*) cipherText);
if (result < 0) {
goto error;
} else if (result != BITS_PER_BLOCK) {
result = BAD_NUMBER_OF_BITS_PROCESSED;
goto error;
}
render("CT=", cipherText, WORDS_PER_BLOCK);
printf("\n");
/* decrypt and see if it comes out the same */
key.direction = DIR_DECRYPT;
render("CT=", cipherText, WORDS_PER_BLOCK);
result = blockDecrypt(&cipher, &key, (BYTE*) cipherText, BITS_PER_BLOCK,
(BYTE*) recoveredPlainText);
if (result < 0) {
goto error;
} else if (result != BITS_PER_BLOCK) {
result = BAD_NUMBER_OF_BITS_PROCESSED;
goto error;
}
render("PT=", recoveredPlainText, WORDS_PER_BLOCK);
if (memcmp((BYTE*)T, (BYTE*)recoveredPlainText, BYTES_PER_BLOCK)) {
result = DECRYPTION_MISMATCH;
goto error;
}
printf("\n");
/* decrypt T */
key.direction = DIR_DECRYPT;
render("CT=", T, WORDS_PER_BLOCK);
result = blockDecrypt(&cipher, &key, (BYTE*) T, BITS_PER_BLOCK,
(BYTE*) plainText);
if (result < 0) {
goto error;
} else if (result != BITS_PER_BLOCK) {
result = BAD_NUMBER_OF_BITS_PROCESSED;
goto error;
}
render("PT=", plainText, WORDS_PER_BLOCK);
printf("\n");
/* encrypt and see if it comes out the same */
key.direction = DIR_ENCRYPT;
render("PT=", plainText, WORDS_PER_BLOCK);
result = blockEncrypt(&cipher, &key, (BYTE*) plainText, BITS_PER_BLOCK,
(BYTE*) recoveredCipherText);
if (result < 0) {
goto error;
} else if (result != BITS_PER_BLOCK) {
result = BAD_NUMBER_OF_BITS_PROCESSED;
goto error;
}
render("CT=", recoveredCipherText, WORDS_PER_BLOCK);
if (memcmp((BYTE*)recoveredCipherText, (BYTE*)T, BYTES_PER_BLOCK)) {
result = ENCRYPTION_MISMATCH;
goto error;
}
printf("\n");
printf("==========\n\n");
}
exit(0);
error:
printf("Error %d (sorry, see serpent-api.h to see what this means)\n",
result);
exit(result);
}
