Mercurial > dropbear

comparison libtommath/bn_mp_xor.c @ 1655:f52919ffd3b1

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
update ltm to 1.1.0 and enable FIPS 186.4 compliant key-generation (#79) * make key-generation compliant to FIPS 186.4 * fix includes in tommath_class.h * update fuzzcorpus instead of error-out * fixup fuzzing make-targets * update Makefile.in * apply necessary patches to ltm sources * clean-up not required ltm files * update to vanilla ltm 1.1.0 this already only contains the required files * remove set/get double
author Steffen Jaeckel <s_jaeckel@gmx.de>
date Mon, 16 Sep 2019 15:50:38 +0200
parents 8bba51a55704
children 1051e4eea25a
comparison
equal deleted inserted replaced
1654:cc0fc5131c5c 1655:f52919ffd3b1
1 #include <tommath_private.h> 1 #include "tommath_private.h"
2 #ifdef BN_MP_XOR_C 2 #ifdef BN_MP_XOR_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
4 * 4 *
5 * LibTomMath is a library that provides multiple-precision 5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality. 6 * integer arithmetic as well as number theoretic functionality.
7 * 7 *
8 * The library was designed directly after the MPI library by 8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with 9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place. 10 * additional optimizations in place.
11 * 11 *
12 * The library is free for all purposes without any express 12 * SPDX-License-Identifier: Unlicense
13 * guarantee it works.
14 *
15 * Tom St Denis, [email protected], http://libtom.org
16 */ 13 */
17 14
18 /* XOR two ints together */ 15 /* XOR two ints together */
19 int 16 int mp_xor(const mp_int *a, const mp_int *b, mp_int *c)
20 mp_xor (mp_int * a, mp_int * b, mp_int * c)
21 { 17 {
22 int res, ix, px; 18 int res, ix, px;
23 mp_int t, *x; 19 mp_int t;
20 const mp_int *x;
24 21
25 if (a->used > b->used) { 22 if (a->used > b->used) {
26 if ((res = mp_init_copy (&t, a)) != MP_OKAY) { 23 if ((res = mp_init_copy(&t, a)) != MP_OKAY) {
27 return res; 24 return res;
28 } 25 }
29 px = b->used; 26 px = b->used;
30 x = b; 27 x = b;
31 } else { 28 } else {
32 if ((res = mp_init_copy (&t, b)) != MP_OKAY) { 29 if ((res = mp_init_copy(&t, b)) != MP_OKAY) {
33 return res; 30 return res;
34 } 31 }
35 px = a->used; 32 px = a->used;
36 x = a; 33 x = a;
37 } 34 }
38 35
39 for (ix = 0; ix < px; ix++) { 36 for (ix = 0; ix < px; ix++) {
40 t.dp[ix] ^= x->dp[ix]; 37 t.dp[ix] ^= x->dp[ix];
41 } 38 }
42 mp_clamp (&t); 39 mp_clamp(&t);
43 mp_exch (c, &t); 40 mp_exch(c, &t);
44 mp_clear (&t); 41 mp_clear(&t);
45 return MP_OKAY; 42 return MP_OKAY;
46 } 43 }
47 #endif 44 #endif
48 45
49 /* ref: $Format:%D$ */ 46 /* ref: HEAD -> master, tag: v1.1.0 */
50 /* git commit: $Format:%H$ */ 47 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
51 /* commit time: $Format:%ai$ */ 48 /* commit time: 2019-01-28 20:32:32 +0100 */