1u=44毫米

一寸一尺一丈长度

1、一寸一尺一丈是我国传统的长度单位,它们之间的关系是十进制。

2、1丈=10尺,1尺=10寸;1丈=3.33米,1尺=3.33分米,1寸=3.33厘米。 

3、尺是古今都有的,但内含的量(实际长度)却不一样:

好的,我可以给你提供一个基于Feistel结构的分组密码的C语言实现代码。以下是代码实现: ```c #include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> #define BLOCK_SIZE 16 // 分组长度为128 bit,即16字节 #define KEY_SIZE 16 // 主密钥长度为128 bit,即16字节 #define ROUNDS 8 // 轮数为8轮 #define LFSR_TAPS 0x168 // LFSR多项式为x^8 + x^6 + x^5 + x^4 + 1 // S盒 const unsigned char s_box[256] = { 0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76, 0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0, 0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15, 0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75, 0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84, 0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF, 0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8, 0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2, 0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73, 0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB, 0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79, 0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08, 0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A, 0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E, 0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF, 0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16 }; // 加密函数 void encrypt(const unsigned char *in, const unsigned char *key, unsigned char *out) { unsigned char left[BLOCK_SIZE/2], right[BLOCK_SIZE/2], temp[BLOCK_SIZE/2]; unsigned int lfsr = 0xACE1; // LFSR初始值 unsigned char round_key[BLOCK_SIZE/2], lfsr_key[BLOCK_SIZE/2]; // 将明文分成两半 memcpy(left, in, BLOCK_SIZE/2); memcpy(right, in + BLOCK_SIZE/2, BLOCK_SIZE/2); // 主密钥扩展 memcpy(round_key, key, BLOCK_SIZE/2); memcpy(lfsr_key, key + BLOCK_SIZE/2, BLOCK_SIZE/2); // 迭代加密 for (int i = 0; i < ROUNDS; i++) { // 生成轮密钥 for (int j = 0; j < BLOCK_SIZE/2; j++) { round_key[j] ^= lfsr_key[j]; } // 线性变换 for (int j = 0; j < BLOCK_SIZE/2; j++) { lfsr = (lfsr >> 1) ^ (-(lfsr & 1u) & LFSR_TAPS); // LFSR生成伪随机数 temp[j] = right[j] ^ (lfsr >> 8); // 取高8位与right异或 } // 非线性变换 for (int j = 0; j < BLOCK_SIZE/2; j++) { right[j] = s_box[temp[j]]; } // 异或操作 for (int j = 0; j < BLOCK_SIZE/2; j++) { temp[j] = left[j] ^ right[j]; } // 交换左右两半 memcpy(left, right, BLOCK_SIZE/2); memcpy(right, temp, BLOCK_SIZE/2); // 更新LFSR密钥 memcpy(lfsr_key, round_key, BLOCK_SIZE/2); memcpy(round_key, key + (i+2)*BLOCK_SIZE/2, BLOCK_SIZE/2); } // 将左右两半交换 memcpy(out, right, BLOCK_SIZE/2); memcpy(out + BLOCK_SIZE/2, left, BLOCK_SIZE/2); } // 解密函数 void decrypt(const unsigned char *in, const unsigned char *key, unsigned char *out) { unsigned char left[BLOCK_SIZE/2], right[BLOCK_SIZE/2], temp[BLOCK_SIZE/2]; unsigned int lfsr = 0xACE1; unsigned char round_key[BLOCK_SIZE/2], lfsr_key[BLOCK_SIZE/2]; // 将密文分成两半 memcpy(right, in, BLOCK_SIZE/2); memcpy(left, in + BLOCK_SIZE/2, BLOCK_SIZE/2); // 主密钥扩展 memcpy(round_key, key + (ROUNDS+1)*BLOCK_SIZE/2, BLOCK_SIZE/2); memcpy(lfsr_key, key + ROUNDS*BLOCK_SIZE/2, BLOCK_SIZE/2); // 迭代解密 for (int i = ROUNDS-1; i >= 0; i--) { // 生成轮密钥 for (int j = 0; j < BLOCK_SIZE/2; j++) { round_key[j] ^= lfsr_key[j]; } // 线性变换 for (int j = 0; j < BLOCK_SIZE/2; j++) { lfsr = (lfsr >> 1) ^ (-(lfsr & 1u) & LFSR_TAPS); temp[j] = right[j] ^ (lfsr >> 8); } // 非线性变换 for (int j = 0; j < BLOCK_SIZE/2; j++) { right[j] = s_box[temp[j]]; } // 异或操作 for (int j = 0; j < BLOCK_SIZE/2; j++) { temp[j] = left[j] ^ right[j]; } // 交换左右两半 memcpy(left, right, BLOCK_SIZE/2); memcpy(right, temp, BLOCK_SIZE/2); // 更新LFSR密钥 memcpy(lfsr_key, round_key, BLOCK_SIZE/2); memcpy(round_key, key + (i+1)*BLOCK_SIZE/2, BLOCK_SIZE/2); } // 将左右两半交换 memcpy(out, right, BLOCK_SIZE/2); memcpy(out + BLOCK_SIZE/2, left, BLOCK_SIZE/2); } int main() { unsigned char in[BLOCK_SIZE] = {0x12, 0x34, 0x56, 0x78, 0x9A, 0xBC, 0xDE, 0xF0, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77, 0x88}; // 明文 unsigned char key[2*KEY_SIZE] = {0}; // 主密钥和LFSR密钥 unsigned char out[BLOCK_SIZE] = {0}; // 密文 // 生成主密钥和LFSR密钥 srand((unsigned int)time(NULL)); for (int i = 0; i < 2*KEY_SIZE; i++) { key[i] = rand() % 256; } // 输出主密钥和明文 printf("Key: "); for (int i = 0; i < 2*KEY_SIZE; i++) { printf("%02x", key[i]); } printf("\n"); printf("Plaintext: "); for (int i = 0; i < BLOCK_SIZE; i++) { printf("%02x", in[i]); } printf("\n"); // 加密 encrypt(in, key, out); printf("Ciphertext: "); for (int i = 0; i < BLOCK_SIZE; i++) { printf("%02x", out[i]); } printf("\n"); // 解密 decrypt(out, key, in); printf("Decrypted text: "); for (int i = 0; i < BLOCK_SIZE; i++) { printf("%02x", in[i]); } printf("\n"); return 0; } ``` 在这个代码中,我使用了一个LFSR来生成伪随机数,进行线性变换。由于C语言中没有位运算符的布尔版本,我使用了“-”符号来进行逻辑运算。具体来说,-x的值为1,当x为0时,否则为0。 在主函数中,我生成了一个随机的主密钥和LFSR密钥,然后对明文进行加密和解密操作,并输出结果。需要注意的是,由于Feistel结构是一种迭代加密算法,所以加密和解密的过程是类似的,只是轮密钥的使用顺序有所不同。 希望这个代码可以对你有所帮助!
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值