📄 math.c
字号:
/* * math.c * * crypto math operations and data types * * David A. McGrew * Cisco Systems, Inc. *//* * * Copyright (c) 2001-2004 Cisco Systems, Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided * with the distribution. * * Neither the name of the Cisco Systems, Inc. nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED * OF THE POSSIBILITY OF SUCH DAMAGE. * */#include "math.h"#include <stdlib.h> /* malloc() used in bitvector_alloc */int octet_weight[256] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8};intlow_bit[256] = { -1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0};inthigh_bit[256] = { -1, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7};inline intoctet_get_weight(octet_t octet) { extern int octet_weight[256]; return octet_weight[octet];} unsigned charv32_weight(v32_t a) { unsigned int wt = 0; wt += octet_weight[a.octet[0]]; /* note: endian-ness makes no difference */ wt += octet_weight[a.octet[1]]; wt += octet_weight[a.octet[2]]; wt += octet_weight[a.octet[3]]; return wt;}inline unsigned charv32_distance(v32_t x, v32_t y) { x.value ^= y.value; return v32_weight(x);}inline unsigned intv32_dot_product(v32_t a, v32_t b) { a.value &= b.value; return v32_weight(a) & 1;}/* * _bit_string returns a NULL-terminated character string suitable for * printing */#define MAX_STRING_LENGTH 1024char bit_string[MAX_STRING_LENGTH];char *octet_bit_string(octet_t x) { int mask, index; for (mask = 1, index = 0; mask < 256; mask <<= 1) if ((x & mask) == 0) bit_string[index++] = '0'; else bit_string[index++] = '1'; bit_string[index++] = 0; /* NULL terminate string */ return bit_string;}char *v16_bit_string(v16_t x) { int i, mask, index; for (i = index = 0; i < 2; i++) { for (mask = 1; mask < 256; mask <<= 1) if ((x.octet[i] & mask) == 0) bit_string[index++] = '0'; else bit_string[index++] = '1'; } bit_string[index++] = 0; /* NULL terminate string */ return bit_string;}char *v32_bit_string(v32_t x) { int i, mask, index; for (i = index = 0; i < 4; i++) { for (mask = 128; mask > 0; mask >>= 1) if ((x.octet[i] & mask) == 0) bit_string[index++] = '0'; else bit_string[index++] = '1'; } bit_string[index++] = 0; /* NULL terminate string */ return bit_string;}char *v64_bit_string(v64_t x) { int i, mask, index; for (i = index = 0; i < 8; i++) { for (mask = 1; mask < 256; mask <<= 1) if ((x.octet[i] & mask) == 0) bit_string[index++] = '0'; else bit_string[index++] = '1'; } bit_string[index++] = 0; /* NULL terminate string */ return bit_string;}char *v128_bit_string(v128_t x) { int j, index; uint32_t mask; for (j=index=0; j < 4; j++) { for (mask=0x80000000; mask > 0; mask >>= 1) { if (x.v32[j] & mask) bit_string[index] = '1'; else bit_string[index] = '0'; ++index; } } bit_string[128] = 0; /* null terminate string */ return bit_string;}octet_tnibble_to_hex_char(octet_t nibble) { char buf[16] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' }; return buf[nibble & 0xF];}char *octet_hex_string(octet_t x) { bit_string[0] = nibble_to_hex_char(x >> 4); bit_string[1] = nibble_to_hex_char(x & 0xF); bit_string[2] = 0; /* null terminate string */ return bit_string;}char *octet_string_hex_string(const octet_t *str, int length) { int i; /* double length, since one octet takes two hex characters */ length *= 2; /* truncate string if it would be too long */ if (length > MAX_STRING_LENGTH) length = MAX_STRING_LENGTH-1; for (i=0; i < length; i+=2) { bit_string[i] = nibble_to_hex_char(*str >> 4); bit_string[i+1] = nibble_to_hex_char(*str++ & 0xF); } bit_string[i] = 0; /* null terminate string */ return bit_string;}char *v16_hex_string(v16_t x) { int i, j; for (i=j=0; i < 2; i++) { bit_string[j++] = nibble_to_hex_char(x.octet[i] >> 4); bit_string[j++] = nibble_to_hex_char(x.octet[i] & 0xF); } bit_string[j] = 0; /* null terminate string */ return bit_string;}char *v32_hex_string(v32_t x) { int i, j; for (i=j=0; i < 4; i++) { bit_string[j++] = nibble_to_hex_char(x.octet[i] >> 4); bit_string[j++] = nibble_to_hex_char(x.octet[i] & 0xF); } bit_string[j] = 0; /* null terminate string */ return bit_string;}char *v64_hex_string(v64_t x) { int i, j; for (i=j=0; i < 8; i++) { bit_string[j++] = nibble_to_hex_char(x.octet[i] >> 4); bit_string[j++] = nibble_to_hex_char(x.octet[i] & 0xF); } bit_string[j] = 0; /* null terminate string */ return bit_string;}char *v128_hex_string(v128_t x) { int i, j; for (i=j=0; i < 16; i++) { bit_string[j++] = nibble_to_hex_char(x.octet[i] >> 4); bit_string[j++] = nibble_to_hex_char(x.octet[i] & 0xF); } bit_string[j] = 0; /* null terminate string */ return bit_string;}char *char_to_hex_string(char *x, int num_char) { int i, j; if (num_char >= 16) num_char = 16; for (i=j=0; i < num_char; i++) { bit_string[j++] = nibble_to_hex_char(x[i] >> 4); bit_string[j++] = nibble_to_hex_char(x[i] & 0xF); } bit_string[j] = 0; /* null terminate string */ return bit_string;}inline inthex_char_to_nibble(octet_t c) { switch(c) { case ('0'): return 0x0; case ('1'): return 0x1; case ('2'): return 0x2; case ('3'): return 0x3; case ('4'): return 0x4; case ('5'): return 0x5; case ('6'): return 0x6; case ('7'): return 0x7; case ('8'): return 0x8; case ('9'): return 0x9; case ('a'): return 0xa; case ('A'): return 0xa; case ('b'): return 0xb; case ('B'): return 0xb; case ('c'): return 0xc; case ('C'): return 0xc; case ('d'): return 0xd; case ('D'): return 0xd; case ('e'): return 0xe; case ('E'): return 0xe; case ('f'): return 0xf; case ('F'): return 0xf; default: return -1; /* this flags an error */ } return -1; /* this keeps compilers from complaining */}intis_hex_string(char *s) { while(*s != 0) if (hex_char_to_nibble(*s++) == -1) return 0; return 1;}octet_thex_string_to_octet(char *s) { octet_t x; x = (hex_char_to_nibble(s[0]) << 4) | hex_char_to_nibble(s[1] & 0xFF); return x;}/* * hex_string_to_octet_string converts a hexadecimal string * of length 2 * len to a raw octet string of length len */inthex_string_to_octet_string(char *raw, char *hex, int len) { octet_t x; int tmp; int hex_len; hex_len = 0; while (hex_len < len) { tmp = hex_char_to_nibble(hex[0]); if (tmp == -1) return hex_len; x = (tmp << 4); hex_len++; tmp = hex_char_to_nibble(hex[1]); if (tmp == -1) return hex_len; x |= (tmp & 0xff); hex_len++; *raw++ = x; hex += 2; } return hex_len;}v16_thex_string_to_v16(char *s) { v16_t x; int i, j; for (i=j=0; i < 4; i += 2, j++) { x.octet[j] = (hex_char_to_nibble(s[i]) << 4) | hex_char_to_nibble(s[i+1] & 0xFF); } return x;}v32_thex_string_to_v32(char *s) { v32_t x; int i, j; for (i=j=0; i < 8; i += 2, j++) { x.octet[j] = (hex_char_to_nibble(s[i]) << 4) | hex_char_to_nibble(s[i+1] & 0xFF); } return x;}v64_thex_string_to_v64(char *s) {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -