diff options
author | Matt Johnston <matt@ucc.asn.au> | 2006-03-08 13:23:49 +0000 |
---|---|---|
committer | Matt Johnston <matt@ucc.asn.au> | 2006-03-08 13:23:49 +0000 |
commit | 8608a8e64c1aeda096867f43f89e29e1aee207ae (patch) | |
tree | 453ebf8873dd287a2def6a674d42afcc6637cde2 /libtommath/bn_mp_rshd.c | |
parent | 2481693cf23dba90c693762a528d2923cde9c9cc (diff) | |
parent | 882a9ced901348b3a48023443bfd23e0ef9d9b67 (diff) |
propagate from branch 'au.asn.ucc.matt.ltm.dropbear' (head 6c790cad5a7fa866ad062cb3a0c279f7ba788583)
to branch 'au.asn.ucc.matt.dropbear' (head fff0894a0399405a9410ea1c6d118f342cf2aa64)
--HG--
extra : convert_revision : fdf4a7a3b97ae5046139915de7e40399cceb2c01
Diffstat (limited to 'libtommath/bn_mp_rshd.c')
-rw-r--r-- | libtommath/bn_mp_rshd.c | 68 |
1 files changed, 68 insertions, 0 deletions
diff --git a/libtommath/bn_mp_rshd.c b/libtommath/bn_mp_rshd.c new file mode 100644 index 0000000..913dda6 --- /dev/null +++ b/libtommath/bn_mp_rshd.c @@ -0,0 +1,68 @@ +#include <tommath.h> +#ifdef BN_MP_RSHD_C +/* LibTomMath, multiple-precision integer library -- Tom St Denis + * + * LibTomMath is a library that provides multiple-precision + * integer arithmetic as well as number theoretic functionality. + * + * The library was designed directly after the MPI library by + * Michael Fromberger but has been written from scratch with + * additional optimizations in place. + * + * The library is free for all purposes without any express + * guarantee it works. + * + * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + */ + +/* shift right a certain amount of digits */ +void mp_rshd (mp_int * a, int b) +{ + int x; + + /* if b <= 0 then ignore it */ + if (b <= 0) { + return; + } + + /* if b > used then simply zero it and return */ + if (a->used <= b) { + mp_zero (a); + return; + } + + { + register mp_digit *bottom, *top; + + /* shift the digits down */ + + /* bottom */ + bottom = a->dp; + + /* top [offset into digits] */ + top = a->dp + b; + + /* this is implemented as a sliding window where + * the window is b-digits long and digits from + * the top of the window are copied to the bottom + * + * e.g. + + b-2 | b-1 | b0 | b1 | b2 | ... | bb | ----> + /\ | ----> + \-------------------/ ----> + */ + for (x = 0; x < (a->used - b); x++) { + *bottom++ = *top++; + } + + /* zero the top digits */ + for (; x < a->used; x++) { + *bottom++ = 0; + } + } + + /* remove excess digits */ + a->used -= b; +} +#endif |