mirror of
https://github.com/Telecominfraproject/OpenCellular.git
synced 2026-01-08 00:21:46 +00:00
Rearrange vboot_reference directories to isolate external components.
This creates a new vboot_firmware subdirectory, and which contains the entirety of the BIOS code. There shouldn't be anything in this directory that is NOT required by the BIOS. Review URL: http://codereview.chromium.org/2219004
This commit is contained in:
133
vboot_firmware/lib/cryptolib/rsa_utility.c
Normal file
133
vboot_firmware/lib/cryptolib/rsa_utility.c
Normal file
@@ -0,0 +1,133 @@
|
||||
/* 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.
|
||||
*
|
||||
* Implementation of RSA utility functions.
|
||||
*/
|
||||
|
||||
#include "cryptolib.h"
|
||||
#include "utility.h"
|
||||
|
||||
int RSAProcessedKeySize(int algorithm) {
|
||||
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));
|
||||
}
|
||||
|
||||
RSAPublicKey* RSAPublicKeyNew(void) {
|
||||
RSAPublicKey* key = (RSAPublicKey*) Malloc(sizeof(RSAPublicKey));
|
||||
key->n = NULL;
|
||||
key->rr = NULL;
|
||||
return key;
|
||||
}
|
||||
|
||||
void RSAPublicKeyFree(RSAPublicKey* key) {
|
||||
if (key) {
|
||||
Free(key->n);
|
||||
Free(key->rr);
|
||||
Free(key);
|
||||
}
|
||||
}
|
||||
|
||||
RSAPublicKey* RSAPublicKeyFromBuf(const uint8_t* buf, int len) {
|
||||
RSAPublicKey* key = RSAPublicKeyNew();
|
||||
MemcpyState st;
|
||||
int key_len;
|
||||
|
||||
st.remaining_buf = (uint8_t*) buf;
|
||||
st.remaining_len = len;
|
||||
st.overrun = 0;
|
||||
|
||||
StatefulMemcpy(&st, &key->len, sizeof(key->len));
|
||||
key_len = key->len * sizeof(uint32_t); /* key length in bytes. */
|
||||
|
||||
/* Sanity Check the key length. */
|
||||
if (RSA1024NUMBYTES != key_len &&
|
||||
RSA2048NUMBYTES != key_len &&
|
||||
RSA4096NUMBYTES != key_len &&
|
||||
RSA8192NUMBYTES != key_len) {
|
||||
RSAPublicKeyFree(key);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
key->n = (uint32_t*) Malloc(key_len);
|
||||
key->rr = (uint32_t*) Malloc(key_len);
|
||||
|
||||
StatefulMemcpy(&st, &key->n0inv, sizeof(key->n0inv));
|
||||
StatefulMemcpy(&st, key->n, key_len);
|
||||
StatefulMemcpy(&st, key->rr, key_len);
|
||||
if (st.overrun || st.remaining_len != 0) { /* Underrun or overrun. */
|
||||
RSAPublicKeyFree(key);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
return key;
|
||||
}
|
||||
|
||||
int RSAVerifyBinary_f(const uint8_t* key_blob,
|
||||
const RSAPublicKey* key,
|
||||
const uint8_t* buf,
|
||||
uint64_t len,
|
||||
const uint8_t* sig,
|
||||
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];
|
||||
|
||||
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 = RSAVerify(verification_key, sig, sig_size, algorithm, digest);
|
||||
|
||||
Free(digest);
|
||||
if (!key)
|
||||
RSAPublicKeyFree(verification_key); /* Only free if we allocated it. */
|
||||
return success;
|
||||
}
|
||||
|
||||
/* Version of RSAVerifyBinary_f() where instead of the raw binary blob
|
||||
* of data, its digest is passed as the argument. */
|
||||
int RSAVerifyBinaryWithDigest_f(const uint8_t* key_blob,
|
||||
const RSAPublicKey* key,
|
||||
const uint8_t* digest,
|
||||
const uint8_t* sig,
|
||||
int algorithm) {
|
||||
RSAPublicKey* verification_key = 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];
|
||||
|
||||
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. */
|
||||
|
||||
success = RSAVerify(verification_key, sig, sig_size, algorithm, digest);
|
||||
|
||||
if (!key)
|
||||
RSAPublicKeyFree(verification_key); /* Only free if we allocated it. */
|
||||
return success;
|
||||
}
|
||||
Reference in New Issue
Block a user