Mercurial > dropbear
comparison libtommath/bn_mp_reduce_2k_l.c @ 511:582cb38e4eb5 insecure-nocrypto
propagate from branch 'au.asn.ucc.matt.dropbear' (head cdcc3c729e29544e8b98a408e2dc60e4483dfd2a)
to branch 'au.asn.ucc.matt.dropbear.insecure-nocrypto' (head 0ca38a1cf349f7426ac9de34ebe4c3e3735effab)
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Thu, 06 Nov 2008 13:16:55 +0000 |
parents | 5ff8218bcee9 |
children | 60fc6476e044 |
comparison
equal
deleted
inserted
replaced
361:461c4b1fb35f | 511:582cb38e4eb5 |
---|---|
10 * additional optimizations in place. | 10 * additional optimizations in place. |
11 * | 11 * |
12 * The library is free for all purposes without any express | 12 * The library is free for all purposes without any express |
13 * guarantee it works. | 13 * guarantee it works. |
14 * | 14 * |
15 * Tom St Denis, [email protected], http://math.libtomcrypt.org | 15 * Tom St Denis, [email protected], http://math.libtomcrypt.com |
16 */ | 16 */ |
17 | 17 |
18 /* reduces a modulo n where n is of the form 2**p - d | 18 /* reduces a modulo n where n is of the form 2**p - d |
19 This differs from reduce_2k since "d" can be larger | 19 This differs from reduce_2k since "d" can be larger |
20 than a single digit. | 20 than a single digit. |
54 mp_clear(&q); | 54 mp_clear(&q); |
55 return res; | 55 return res; |
56 } | 56 } |
57 | 57 |
58 #endif | 58 #endif |
59 | |
60 /* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k_l.c,v $ */ | |
61 /* $Revision: 1.3 $ */ | |
62 /* $Date: 2006/03/31 14:18:44 $ */ |