precompute_ecmult.c (4141B)
1 /***************************************************************************************************** 2 * Copyright (c) 2013, 2014, 2017, 2021 Pieter Wuille, Andrew Poelstra, Jonas Nick, Russell O'Connor * 3 * Distributed under the MIT software license, see the accompanying * 4 * file COPYING or https://www.opensource.org/licenses/mit-license.php. * 5 *****************************************************************************************************/ 6 7 #include <inttypes.h> 8 #include <stdio.h> 9 10 #include "../include/secp256k1.h" 11 12 #include "assumptions.h" 13 #include "util.h" 14 15 #include "field_impl.h" 16 #include "group_impl.h" 17 #include "int128_impl.h" 18 #include "ecmult.h" 19 #include "ecmult_compute_table_impl.h" 20 21 static void print_table(FILE *fp, const char *name, int window_g, const haskellsecp256k1_v0_1_0_ge_storage* table) { 22 int j; 23 int i; 24 25 fprintf(fp, "const haskellsecp256k1_v0_1_0_ge_storage %s[ECMULT_TABLE_SIZE(WINDOW_G)] = {\n", name); 26 fprintf(fp, " S(%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32 27 ",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32")\n", 28 SECP256K1_GE_STORAGE_CONST_GET(table[0])); 29 30 j = 1; 31 for(i = 3; i <= window_g; ++i) { 32 fprintf(fp, "#if WINDOW_G > %d\n", i-1); 33 for(;j < ECMULT_TABLE_SIZE(i); ++j) { 34 fprintf(fp, ",S(%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32 35 ",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32",%"PRIx32")\n", 36 SECP256K1_GE_STORAGE_CONST_GET(table[j])); 37 } 38 fprintf(fp, "#endif\n"); 39 } 40 fprintf(fp, "};\n"); 41 } 42 43 static void print_two_tables(FILE *fp, int window_g) { 44 haskellsecp256k1_v0_1_0_ge_storage* table = malloc(ECMULT_TABLE_SIZE(window_g) * sizeof(haskellsecp256k1_v0_1_0_ge_storage)); 45 haskellsecp256k1_v0_1_0_ge_storage* table_128 = malloc(ECMULT_TABLE_SIZE(window_g) * sizeof(haskellsecp256k1_v0_1_0_ge_storage)); 46 47 haskellsecp256k1_v0_1_0_ecmult_compute_two_tables(table, table_128, window_g, &haskellsecp256k1_v0_1_0_ge_const_g); 48 49 print_table(fp, "haskellsecp256k1_v0_1_0_pre_g", window_g, table); 50 print_table(fp, "haskellsecp256k1_v0_1_0_pre_g_128", window_g, table_128); 51 52 free(table); 53 free(table_128); 54 } 55 56 int main(void) { 57 /* Always compute all tables for window sizes up to 15. */ 58 int window_g = (ECMULT_WINDOW_SIZE < 15) ? 15 : ECMULT_WINDOW_SIZE; 59 const char outfile[] = "src/precomputed_ecmult.c"; 60 FILE* fp; 61 62 fp = fopen(outfile, "w"); 63 if (fp == NULL) { 64 fprintf(stderr, "Could not open %s for writing!\n", outfile); 65 return -1; 66 } 67 68 fprintf(fp, "/* This file was automatically generated by precompute_ecmult. */\n"); 69 fprintf(fp, "/* This file contains an array haskellsecp256k1_v0_1_0_pre_g with odd multiples of the base point G and\n"); 70 fprintf(fp, " * an array haskellsecp256k1_v0_1_0_pre_g_128 with odd multiples of 2^128*G for accelerating the computation of a*P + b*G.\n"); 71 fprintf(fp, " */\n"); 72 fprintf(fp, "#include \"group.h\"\n"); 73 fprintf(fp, "#include \"ecmult.h\"\n"); 74 fprintf(fp, "#include \"precomputed_ecmult.h\"\n"); 75 fprintf(fp, "#define S(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) SECP256K1_GE_STORAGE_CONST(0x##a##u,0x##b##u,0x##c##u,0x##d##u,0x##e##u,0x##f##u,0x##g##u,0x##h##u,0x##i##u,0x##j##u,0x##k##u,0x##l##u,0x##m##u,0x##n##u,0x##o##u,0x##p##u)\n"); 76 fprintf(fp, "#if ECMULT_WINDOW_SIZE > %d\n", window_g); 77 fprintf(fp, " #error configuration mismatch, invalid ECMULT_WINDOW_SIZE. Try deleting precomputed_ecmult.c before the build.\n"); 78 fprintf(fp, "#endif\n"); 79 fprintf(fp, "#ifdef EXHAUSTIVE_TEST_ORDER\n"); 80 fprintf(fp, "# error Cannot compile precomputed_ecmult.c in exhaustive test mode\n"); 81 fprintf(fp, "#endif /* EXHAUSTIVE_TEST_ORDER */\n"); 82 fprintf(fp, "#define WINDOW_G ECMULT_WINDOW_SIZE\n"); 83 84 print_two_tables(fp, window_g); 85 86 fprintf(fp, "#undef S\n"); 87 fclose(fp); 88 89 return 0; 90 }