Home | History | Annotate | Download | only in crypto 
      1 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
      2 // Use of this source code is governed by a BSD-style license that can be
      3 // found in the LICENSE file.
      4 
      5 #include <algorithm>
      6 
      7 #include "crypto/ghash.h"
      8 
      9 #include "testing/gtest/include/gtest/gtest.h"
     10 
     11 namespace crypto {
     12 
     13 namespace {
     14 
     15 // Test vectors are taken from Appendix B of
     16 // http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/gcm/gcm-revised-spec.pdf
     17 
     18 static const uint8 kKey1[16] = {
     19   0x66, 0xe9, 0x4b, 0xd4, 0xef, 0x8a, 0x2c, 0x3b,
     20   0x88, 0x4c, 0xfa, 0x59, 0xca, 0x34, 0x2b, 0x2e,
     21 };
     22 
     23 static const uint8 kCiphertext2[] = {
     24   0x03, 0x88, 0xda, 0xce, 0x60, 0xb6, 0xa3, 0x92,
     25   0xf3, 0x28, 0xc2, 0xb9, 0x71, 0xb2, 0xfe, 0x78,
     26 };
     27 
     28 static const uint8 kKey3[16] = {
     29   0xb8, 0x3b, 0x53, 0x37, 0x08, 0xbf, 0x53, 0x5d,
     30   0x0a, 0xa6, 0xe5, 0x29, 0x80, 0xd5, 0x3b, 0x78,
     31 };
     32 
     33 static const uint8 kCiphertext3[] = {
     34   0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24,
     35   0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
     36   0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0,
     37   0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1, 0x2e,
     38   0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c,
     39   0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84, 0xaa, 0x05,
     40   0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97,
     41   0x3d, 0x58, 0xe0, 0x91, 0x47, 0x3f, 0x59, 0x85,
     42 };
     43 
     44 static const uint8 kAdditional4[] = {
     45   0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
     46   0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
     47   0xab, 0xad, 0xda, 0xd2,
     48 };
     49 
     50 struct TestCase {
     51   const uint8* key;
     52   const uint8* additional;
     53   unsigned additional_length;
     54   const uint8* ciphertext;
     55   unsigned ciphertext_length;
     56   const uint8 expected[16];
     57 };
     58 
     59 static const TestCase kTestCases[] = {
     60   {
     61     kKey1,
     62     NULL,
     63     0,
     64     NULL,
     65     0,
     66     {
     67       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
     68       0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
     69     },
     70   },
     71   {
     72     kKey1,
     73     NULL,
     74     0,
     75     kCiphertext2,
     76     sizeof(kCiphertext2),
     77     {
     78       0xf3, 0x8c, 0xbb, 0x1a, 0xd6, 0x92, 0x23, 0xdc,
     79       0xc3, 0x45, 0x7a, 0xe5, 0xb6, 0xb0, 0xf8, 0x85,
     80     },
     81   },
     82   {
     83     kKey3,
     84     NULL,
     85     0,
     86     kCiphertext3,
     87     sizeof(kCiphertext3),
     88     {
     89       0x7f, 0x1b, 0x32, 0xb8, 0x1b, 0x82, 0x0d, 0x02,
     90       0x61, 0x4f, 0x88, 0x95, 0xac, 0x1d, 0x4e, 0xac,
     91     },
     92   },
     93   {
     94     kKey3,
     95     kAdditional4,
     96     sizeof(kAdditional4),
     97     kCiphertext3,
     98     sizeof(kCiphertext3) - 4,
     99     {
    100       0x69, 0x8e, 0x57, 0xf7, 0x0e, 0x6e, 0xcc, 0x7f,
    101       0xd9, 0x46, 0x3b, 0x72, 0x60, 0xa9, 0xae, 0x5f,
    102     },
    103   },
    104 };
    105 
    106 TEST(GaloisHash, TestCases) {
    107   uint8 out[16];
    108 
    109   for (size_t i = 0; i < arraysize(kTestCases); ++i) {
    110     const TestCase& test = kTestCases[i];
    111 
    112     GaloisHash hash(test.key);
    113     if (test.additional_length)
    114       hash.UpdateAdditional(test.additional, test.additional_length);
    115     if (test.ciphertext_length)
    116       hash.UpdateCiphertext(test.ciphertext, test.ciphertext_length);
    117     hash.Finish(out, sizeof(out));
    118     EXPECT_TRUE(0 == memcmp(out, test.expected, 16));
    119   }
    120 }
    121 
    122 TEST(GaloisHash, VaryLengths) {
    123   uint8 out[16];
    124 
    125   for (size_t chunk_size = 1; chunk_size < 16; chunk_size++) {
    126     for (size_t i = 0; i < arraysize(kTestCases); ++i) {
    127       const TestCase& test = kTestCases[i];
    128 
    129       GaloisHash hash(test.key);
    130       for (size_t i = 0; i < test.additional_length;) {
    131         size_t n = std::min(test.additional_length - i, chunk_size);
    132         hash.UpdateAdditional(test.additional + i, n);
    133         i += n;
    134       }
    135       for (size_t i = 0; i < test.ciphertext_length;) {
    136         size_t n = std::min(test.ciphertext_length - i, chunk_size);
    137         hash.UpdateCiphertext(test.ciphertext + i, n);
    138         i += n;
    139       }
    140       hash.Finish(out, sizeof(out));
    141       EXPECT_TRUE(0 == memcmp(out, test.expected, 16));
    142     }
    143   }
    144 }
    145 
    146 }  // namespace
    147 
    148 }  // namespace crypto
    149