Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* |
michael@0 | 2 | * Simple test driver for MPI library |
michael@0 | 3 | * |
michael@0 | 4 | * Test 4: Modular arithmetic tests |
michael@0 | 5 | * |
michael@0 | 6 | * This Source Code Form is subject to the terms of the Mozilla Public |
michael@0 | 7 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
michael@0 | 8 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
michael@0 | 9 | |
michael@0 | 10 | #include <stdio.h> |
michael@0 | 11 | #include <stdlib.h> |
michael@0 | 12 | #include <string.h> |
michael@0 | 13 | #include <ctype.h> |
michael@0 | 14 | #include <limits.h> |
michael@0 | 15 | |
michael@0 | 16 | #include "mpi.h" |
michael@0 | 17 | |
michael@0 | 18 | int main(int argc, char *argv[]) |
michael@0 | 19 | { |
michael@0 | 20 | int ix; |
michael@0 | 21 | mp_int a, b, c, m; |
michael@0 | 22 | mp_digit r; |
michael@0 | 23 | |
michael@0 | 24 | if(argc < 4) { |
michael@0 | 25 | fprintf(stderr, "Usage: %s <a> <b> <m>\n", argv[0]); |
michael@0 | 26 | return 1; |
michael@0 | 27 | } |
michael@0 | 28 | |
michael@0 | 29 | printf("Test 4: Modular arithmetic\n\n"); |
michael@0 | 30 | |
michael@0 | 31 | mp_init(&a); |
michael@0 | 32 | mp_init(&b); |
michael@0 | 33 | mp_init(&m); |
michael@0 | 34 | |
michael@0 | 35 | mp_read_radix(&a, argv[1], 10); |
michael@0 | 36 | mp_read_radix(&b, argv[2], 10); |
michael@0 | 37 | mp_read_radix(&m, argv[3], 10); |
michael@0 | 38 | printf("a = "); mp_print(&a, stdout); fputc('\n', stdout); |
michael@0 | 39 | printf("b = "); mp_print(&b, stdout); fputc('\n', stdout); |
michael@0 | 40 | printf("m = "); mp_print(&m, stdout); fputc('\n', stdout); |
michael@0 | 41 | |
michael@0 | 42 | mp_init(&c); |
michael@0 | 43 | printf("\nc = a (mod m)\n"); |
michael@0 | 44 | |
michael@0 | 45 | mp_mod(&a, &m, &c); |
michael@0 | 46 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 47 | |
michael@0 | 48 | printf("\nc = b (mod m)\n"); |
michael@0 | 49 | |
michael@0 | 50 | mp_mod(&b, &m, &c); |
michael@0 | 51 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 52 | |
michael@0 | 53 | printf("\nc = b (mod 1853)\n"); |
michael@0 | 54 | |
michael@0 | 55 | mp_mod_d(&b, 1853, &r); |
michael@0 | 56 | printf("c = %04X\n", r); |
michael@0 | 57 | |
michael@0 | 58 | printf("\nc = (a + b) mod m\n"); |
michael@0 | 59 | |
michael@0 | 60 | mp_addmod(&a, &b, &m, &c); |
michael@0 | 61 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 62 | |
michael@0 | 63 | printf("\nc = (a - b) mod m\n"); |
michael@0 | 64 | |
michael@0 | 65 | mp_submod(&a, &b, &m, &c); |
michael@0 | 66 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 67 | |
michael@0 | 68 | printf("\nc = (a * b) mod m\n"); |
michael@0 | 69 | |
michael@0 | 70 | mp_mulmod(&a, &b, &m, &c); |
michael@0 | 71 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 72 | |
michael@0 | 73 | printf("\nc = (a ** b) mod m\n"); |
michael@0 | 74 | |
michael@0 | 75 | mp_exptmod(&a, &b, &m, &c); |
michael@0 | 76 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 77 | |
michael@0 | 78 | printf("\nIn-place modular squaring test:\n"); |
michael@0 | 79 | for(ix = 0; ix < 5; ix++) { |
michael@0 | 80 | printf("a = (a * a) mod m a = "); |
michael@0 | 81 | mp_sqrmod(&a, &m, &a); |
michael@0 | 82 | mp_print(&a, stdout); |
michael@0 | 83 | fputc('\n', stdout); |
michael@0 | 84 | } |
michael@0 | 85 | |
michael@0 | 86 | |
michael@0 | 87 | mp_clear(&c); |
michael@0 | 88 | mp_clear(&m); |
michael@0 | 89 | mp_clear(&b); |
michael@0 | 90 | mp_clear(&a); |
michael@0 | 91 | |
michael@0 | 92 | return 0; |
michael@0 | 93 | } |