找不到这个6598f2c的提交怎么办,并且我不知道完整的commit-SHA
时间: 2024-04-18 18:29:48 浏览: 11
对于找不到提交 "6598f2c" 的问题,你可以尝试以下几种方法:
1. 使用 Git 历史记录查找:你可以使用以下命令查看 Git 仓库的历史记录,以尝试找到包含 "6598f2c" 的提交:
```
git log
```
这将显示提交的完整列表,包括每个提交的 SHA 和相关信息。你可以按下 `/` 键进入搜索模式,然后输入 "6598f2c" 进行搜索。如果找到相应的提交,你将看到完整的提交 SHA 和相关信息。
2. 使用模糊搜索:如果你不知道完整的提交 SHA,你可以尝试使用模糊搜索来查找相关提交。使用以下命令:
```
git log --grep=<commit-message>
```
将 `<commit-message>` 替换为你认为可能与提交相关的信息,如提交消息、作者名称等。这将显示包含指定信息的提交列表。
3. 使用 Git 图形界面工具:如果你对命令行不熟悉,你可以使用 Git 图形界面工具,如 Git GUI、GitKraken 等。这些工具通常提供更直观的界面,帮助你浏览和搜索提交。
如果以上方法仍然无法找到提交 "6598f2c",可能是因为该提交不存在于当前克隆的仓库中或已被删除。如果你知道该提交存在于其他分支、远程仓库或历史记录中,你可以尝试切换到相应的分支或克隆完整的远程仓库进行查找。
相关问题
用C语言写一个SHA-512加解密系统
SHA-512是一种安全哈希算法,用于产生消息摘要,不是加解密系统。下面是一个用C语言实现SHA-512算法的示例代码:
```c
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#define SHA512_BLOCK_SIZE 128
#define SHA512_DIGEST_SIZE 64
typedef struct SHA512_Context {
uint64_t state[8];
uint64_t bitcount[2];
uint8_t buffer[SHA512_BLOCK_SIZE];
} SHA512_Context;
static const uint64_t K[80] = {
0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
};
static const uint8_t padding[SHA512_BLOCK_SIZE] = {
0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
static void SHA512_Transform(SHA512_Context *ctx) {
uint64_t W[80];
uint64_t A, B, C, D, E, F, G, H, T1, T2;
int i;
for (i = 0; i < 16; i++) {
W[i] = ((uint64_t)ctx->buffer[i * 8 + 0] << 56) |
((uint64_t)ctx->buffer[i * 8 + 1] << 48) |
((uint64_t)ctx->buffer[i * 8 + 2] << 40) |
((uint64_t)ctx->buffer[i * 8 + 3] << 32) |
((uint64_t)ctx->buffer[i * 8 + 4] << 24) |
((uint64_t)ctx->buffer[i * 8 + 5] << 16) |
((uint64_t)ctx->buffer[i * 8 + 6] << 8) |
((uint64_t)ctx->buffer[i * 8 + 7] << 0);
}
for (i = 16; i < 80; i++) {
W[i] = W[i-16] + W[i-7] + (ROTR(W[i-15], 1) ^ ROTR(W[i-15], 8) ^ (W[i-15] >> 7)) + (ROTR(W[i-2], 19) ^ ROTR(W[i-2], 61) ^ (W[i-2] >> 6));
}
A = ctx->state[0];
B = ctx->state[1];
C = ctx->state[2];
D = ctx->state[3];
E = ctx->state[4];
F = ctx->state[5];
G = ctx->state[6];
H = ctx->state[7];
for (i = 0; i < 80; i++) {
T1 = H + (ROTR(E, 14) ^ ROTR(E, 18) ^ ROTR(E, 41)) + ((E & F) ^ (~E & G)) + K[i] + W[i];
T2 = (ROTR(A, 28) ^ ROTR(A, 34) ^ ROTR(A, 39)) + ((A & B) ^ (A & C) ^ (B & C));
H = G;
G = F;
F = E;
E = D + T1;
D = C;
C = B;
B = A;
A = T1 + T2;
}
ctx->state[0] += A;
ctx->state[1] += B;
ctx->state[2] += C;
ctx->state[3] += D;
ctx->state[4] += E;
ctx->state[5] += F;
ctx->state[6] += G;
ctx->state[7] += H;
}
void SHA512_Init(SHA512_Context *ctx) {
memset(ctx, 0, sizeof(*ctx));
ctx->state[0] = 0x6a09e667f3bcc908ULL;
ctx->state[1] = 0xbb67ae8584caa73bULL;
ctx->state[2] = 0x3c6ef372fe94f82bULL;
ctx->state[3] = 0xa54ff53a5f1d36f1ULL;
ctx->state[4] = 0x510e527fade682d1ULL;
ctx->state[5] = 0x9b05688c2b3e6c1fULL;
ctx->state[6] = 0x1f83d9abfb41bd6bULL;
ctx->state[7] = 0x5be0cd19137e2179ULL;
}
void SHA512_Update(SHA512_Context *ctx, const uint8_t *data, size_t len) {
size_t i;
for (i = 0; i < len; i++) {
ctx->buffer[ctx->bitcount[0] % SHA512_BLOCK_SIZE] = data[i];
ctx->bitcount[0] += 8;
if (ctx->bitcount[0] == 0) {
ctx->bitcount[1]++;
}
if (ctx->bitcount[0] % SHA512_BLOCK_SIZE == 0) {
SHA512_Transform(ctx);
}
}
}
void SHA512_Final(SHA512_Context *ctx, uint8_t *digest) {
uint64_t totalbits = ctx->bitcount[0] + (ctx->bitcount[1] << 32);
size_t padlen = SHA512_BLOCK_SIZE - (size_t)(ctx->bitcount[0] % SHA512_BLOCK_SIZE);
int i;
SHA512_Update(ctx, padding, padlen);
SHA512_Update(ctx, (uint8_t *)&totalbits, sizeof(totalbits));
for (i = 0; i < SHA512_DIGEST_SIZE / 8; i++) {
digest[i * 8 + 0] = (ctx->state[i] >> 56) & 0xff;
digest[i * 8 + 1] = (ctx->state[i] >> 48) & 0xff;
digest[i * 8 + 2] = (ctx->state[i] >> 40) & 0xff;
digest[i * 8 + 3] = (ctx->state[i] >> 32) & 0xff;
digest[i * 8 + 4] = (ctx->state[i] >> 24) & 0xff;
digest[i * 8 + 5] = (ctx->state[i] >> 16) & 0xff;
digest[i * 8 + 6] = (ctx->state[i] >> 8) & 0xff;
digest[i * 8 + 7] = (ctx->state[i] >> 0) & 0xff;
}
}
int main() {
SHA512_Context ctx;
uint8_t digest[SHA512_DIGEST_SIZE];
char message[] = "Hello, world!";
size_t len = strlen(message);
SHA512_Init(&ctx);
SHA512_Update(&ctx, (uint8_t *)message, len);
SHA512_Final(&ctx, digest);
int i;
for (i = 0; i < SHA512_DIGEST_SIZE; i++) {
printf("%02x", digest[i]);
}
printf("\n");
return 0;
}
```
该代码可以计算输入消息的SHA-512哈希值。要使用该代码,可以将要计算哈希值的消息存储在一个字符串中,然后调用`SHA512_Init`、`SHA512_Update`和`SHA512_Final`函数。最终的哈希值将存储在一个64字节的缓冲区中。
用c语言实现基于BS模式的SHA-256算法文件完整性程序
以下是基于BS模式的SHA-256算法文件完整性程序的C语言实现:
```c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#define ROTL(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
#define ROTR(x, n) (((x) >> (n)) | ((x) << (32 - (n))))
#define SHR(x, n) ((x) >> (n))
#define CH(x, y, z) (((x) & (y)) ^ (~(x) & (z)))
#define MAJ(x, y, z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
#define EP0(x) (ROTR(x, 2) ^ ROTR(x, 13) ^ ROTR(x, 22))
#define EP1(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25))
#define SIG0(x) (ROTR(x, 7) ^ ROTR(x, 18) ^ SHR(x, 3))
#define SIG1(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHR(x, 10))
static const uint32_t K[64] = {
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
};
static void sha256_transform(uint32_t state[8], const uint8_t data[64])
{
uint32_t a, b, c, d, e, f, g, h, i, j, t1, t2, m[64];
for (i=0, j=0; i<16; ++i, j+=4)
m[i] = (data[j] << 24) | (data[j+1] << 16) | (data[j+2] << 8) | (data[j+3]);
for (; i<64; ++i)
m[i] = SIG1(m[i-2]) + m[i-7] + SIG0(m[i-15]) + m[i-16];
a = state[0];
b = state[1];
c = state[2];
d = state[3];
e = state[4];
f = state[5];
g = state[6];
h = state[7];
for (i=0; i<64; ++i) {
t1 = h + EP1(e) + CH(e, f, g) + K[i] + m[i];
t2 = EP0(a) + MAJ(a, b, c);
h = g;
g = f;
f = e;
e = d + t1;
d = c;
c = b;
b = a;
a = t1 + t2;
}
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
state[5] += f;
state[6] += g;
state[7] += h;
}
void sha256(const uint8_t *msg, size_t len, uint8_t hash[32])
{
uint32_t state[8] = {
0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
};
uint8_t data[64];
size_t i, j;
for (i=0; i<len; ++i) {
if ((i & 63) == 0 && i > 0)
sha256_transform(state, data);
j = i & 63;
data[j] = msg[i];
}
j = i & 63;
data[j++] = 0x80;
if (j > 56) {
memset(data+j, 0, 64-j);
sha256_transform(state, data);
j = 0;
}
memset(data+j, 0, 56-j);
uint64_t bitlen = (uint64_t)len * 8;
data[56] = (bitlen >> 56) & 0xff;
data[57] = (bitlen >> 48) & 0xff;
data[58] = (bitlen >> 40) & 0xff;
data[59] = (bitlen >> 32) & 0xff;
data[60] = (bitlen >> 24) & 0xff;
data[61] = (bitlen >> 16) & 0xff;
data[62] = (bitlen >> 8) & 0xff;
data[63] = bitlen & 0xff;
sha256_transform(state, data);
for (i=0; i<8; ++i) {
hash[i*4] = (state[i] >> 24) & 0xff;
hash[i*4+1] = (state[i] >> 16) & 0xff;
hash[i*4+2] = (state[i] >> 8) & 0xff;
hash[i*4+3] = state[i] & 0xff;
}
}
int main(int argc, char **argv)
{
if (argc < 2) {
printf("Usage: %s <filename>\n", argv[0]);
return 1;
}
FILE *fp = fopen(argv[1], "rb");
if (!fp) {
printf("Unable to open file: %s\n", argv[1]);
return 1;
}
fseek(fp, 0L, SEEK_END);
size_t size = ftell(fp);
rewind(fp);
uint8_t *buf = (uint8_t*)malloc(size);
if (!buf) {
printf("Unable to allocate memory\n");
fclose(fp);
return 1;
}
if (fread(buf, 1, size, fp) != size) {
printf("Unable to read file: %s\n", argv[1]);
fclose(fp);
free(buf);
return 1;
}
uint8_t hash[32];
sha256(buf, size, hash);
printf("SHA-256 hash of %s:\n", argv[1]);
for (int i=0; i<32; ++i)
printf("%02x", hash[i]);
printf("\n");
free(buf);
fclose(fp);
return 0;
}
```
该程序使用了BS模式,对文件进行SHA-256算法计算,并输出计算结果。用户可以在命令行中指定要计算哈希值的文件,程序会打开文件并读取其中的内容,然后对内容进行哈希计算。计算结果以16进制形式输出。