Refactor siglen_map[] to store key size in bytes instead of 32-bit words.

src/platform/vboot_reference/crypto/rsa_utility.c

 /* Copyright (c) 2010 The Chromium OS Authors. All rights reserved.
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  *
  * Utility functions for message digest functions.
  */
 
 #include "padding.h"
 #include "rsa_utility.h"
 #include "sha_utility.h"
 #include "utility.h"
 
 int RSAProcessedKeySize(int algorithm) {
-  int key_len = siglen_map[algorithm] * sizeof(uint32_t);  /* Key length in
-                                                            * bytes. */
+  int key_len = siglen_map[algorithm];  /* Key length in
+                                         * bytes. */
   /* Total size needed by a RSAPublicKey structure is =
    *  2 * key_len bytes for the  n and rr arrays
    *  + sizeof len + sizeof n0inv.
    */
   return (2 * key_len + sizeof(int) + sizeof(uint32_t));
 }
 
 void RSAPublicKeyFree(RSAPublicKey* key) {
   if (key) {
     Free(key->n);
@@ skipping 36 matching lines @@
                       int algorithm) {
   RSAPublicKey* verification_key = NULL;
   uint8_t* digest = NULL;
   int key_size;
   int sig_size;
   int success;
 
   if (algorithm >= kNumAlgorithms)
     return 0;  /* Invalid algorithm. */
   key_size = RSAProcessedKeySize(algorithm);
-  sig_size = siglen_map[algorithm] * sizeof(uint32_t);
+  sig_size = siglen_map[algorithm];
 
   if (key_blob && !key)
     verification_key = RSAPublicKeyFromBuf(key_blob, key_size);
   else if (!key_blob && key)
     verification_key = (RSAPublicKey*) key;  /* Supress const warning. */
   else
     return 0; /* Both can't be NULL or non-NULL. */
 
   digest = DigestBuf(buf, len, algorithm);
   success = RSA_verify(verification_key, sig, sig_size, algorithm, digest);
 
   Free(digest);
   if (!key)
     RSAPublicKeyFree(verification_key);  /* Only free if we allocated it. */
   return success;
 }