Thu, 22 Jan 2015 13:21:57 +0100
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
michael@0 | 1 | /* |
michael@0 | 2 | * Simple test driver for MPI library |
michael@0 | 3 | * |
michael@0 | 4 | * Test 5: Other number theoretic functions |
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 | mp_int a, b, c, x, y; |
michael@0 | 21 | |
michael@0 | 22 | if(argc < 3) { |
michael@0 | 23 | fprintf(stderr, "Usage: %s <a> <b>\n", argv[0]); |
michael@0 | 24 | return 1; |
michael@0 | 25 | } |
michael@0 | 26 | |
michael@0 | 27 | printf("Test 5: Number theoretic functions\n\n"); |
michael@0 | 28 | |
michael@0 | 29 | mp_init(&a); |
michael@0 | 30 | mp_init(&b); |
michael@0 | 31 | |
michael@0 | 32 | mp_read_radix(&a, argv[1], 10); |
michael@0 | 33 | mp_read_radix(&b, argv[2], 10); |
michael@0 | 34 | |
michael@0 | 35 | printf("a = "); mp_print(&a, stdout); fputc('\n', stdout); |
michael@0 | 36 | printf("b = "); mp_print(&b, stdout); fputc('\n', stdout); |
michael@0 | 37 | |
michael@0 | 38 | mp_init(&c); |
michael@0 | 39 | printf("\nc = (a, b)\n"); |
michael@0 | 40 | |
michael@0 | 41 | mp_gcd(&a, &b, &c); |
michael@0 | 42 | printf("Euclid: c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 43 | /* |
michael@0 | 44 | mp_bgcd(&a, &b, &c); |
michael@0 | 45 | printf("Binary: c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 46 | */ |
michael@0 | 47 | mp_init(&x); |
michael@0 | 48 | mp_init(&y); |
michael@0 | 49 | printf("\nc = (a, b) = ax + by\n"); |
michael@0 | 50 | |
michael@0 | 51 | mp_xgcd(&a, &b, &c, &x, &y); |
michael@0 | 52 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 53 | printf("x = "); mp_print(&x, stdout); fputc('\n', stdout); |
michael@0 | 54 | printf("y = "); mp_print(&y, stdout); fputc('\n', stdout); |
michael@0 | 55 | |
michael@0 | 56 | printf("\nc = a^-1 (mod b)\n"); |
michael@0 | 57 | if(mp_invmod(&a, &b, &c) == MP_UNDEF) { |
michael@0 | 58 | printf("a has no inverse mod b\n"); |
michael@0 | 59 | } else { |
michael@0 | 60 | printf("c = "); mp_print(&c, stdout); fputc('\n', stdout); |
michael@0 | 61 | } |
michael@0 | 62 | |
michael@0 | 63 | mp_clear(&y); |
michael@0 | 64 | mp_clear(&x); |
michael@0 | 65 | mp_clear(&c); |
michael@0 | 66 | mp_clear(&b); |
michael@0 | 67 | mp_clear(&a); |
michael@0 | 68 | |
michael@0 | 69 | return 0; |
michael@0 | 70 | } |