comparison libtommath/bn_reverse.c @ 1655:f52919ffd3b1

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
comparison
equal deleted inserted replaced
1654:cc0fc5131c5c 1655:f52919ffd3b1
1 #include <tommath_private.h> 1 #include "tommath_private.h"
2 #ifdef BN_REVERSE_C 2 #ifdef BN_REVERSE_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 /* reverse an array, used for radix code */ 15 /* reverse an array, used for radix code */
19 void 16 void bn_reverse(unsigned char *s, int len)
20 bn_reverse (unsigned char *s, int len)
21 { 17 {
22 int ix, iy; 18 int ix, iy;
23 unsigned char t; 19 unsigned char t;
24 20
25 ix = 0; 21 ix = 0;
26 iy = len - 1; 22 iy = len - 1;
27 while (ix < iy) { 23 while (ix < iy) {
28 t = s[ix]; 24 t = s[ix];
29 s[ix] = s[iy]; 25 s[ix] = s[iy];
30 s[iy] = t; 26 s[iy] = t;
31 ++ix; 27 ++ix;
32 --iy; 28 --iy;
33 } 29 }
34 } 30 }
35 #endif 31 #endif
36 32
37 /* ref: $Format:%D$ */ 33 /* ref: HEAD -> master, tag: v1.1.0 */
38 /* git commit: $Format:%H$ */ 34 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
39 /* commit time: $Format:%ai$ */ 35 /* commit time: 2019-01-28 20:32:32 +0100 */