|
2fefcaa0
|
2019-10-15T14:21:30
|
|
copy implementation of mp_to_unsigned_bin_n() to mp_to_signed_bin_n()
|
|
049e2e85
|
2019-10-15T14:02:22
|
|
add back missing symbols
|
|
b6813a41
|
2019-09-27T03:40:08
|
|
replace mp_export/import by mp_pack/unpack
|
|
|
71d1b7b9
|
2019-09-08T23:29:44
|
|
make mp_to_radix return the count of characters of the converted number
|
|
|
abdb0334
|
2019-09-25T00:29:19
|
|
Refactored functions to read and write binaries and added "maxlen"
|
|
|
f0e6ae59
|
2019-09-02T14:36:06
|
|
add `mp_to_radix()`
...a 100% copy&paste of `mp_toradix_n()` besides the changed API signature
|
|
|
ca89e9c0
|
2019-07-03T13:10:05
|
|
rename mp_root/mp_expt to mp_*_u32
|
|
|
71696549
|
2019-05-29T20:36:18
|
|
deprecate mp_expt_d and mp_n_root in favor of mp_expt and mp_root
|
|
0db64fc8
|
2019-07-03T14:45:14
|
|
Rename bn_get_magxx -> bn_get_mag_uxx. Documentation updated too
|
|
b3a4341a
|
2019-05-31T10:53:18
|
|
explicit operator precedence
|
|
|
c7314fa4
|
2019-05-25T06:42:01
|
|
deprecate mp_n_root_ex and mp_expt_d_ex
These functions were introduced to give some timing guarantees.
However the guarantees are too weak to be useful.
The functions seem to be unused essentially by downstream users.
|
|
|
bcec605a
|
2019-05-22T15:34:49
|
|
deprecate mp_prime_is_divisible and ltm_prime_tab
* it is an implementation detail used for prime testing
* there is upcoming work by @czurnieden regarding a generalised prime sieve
* furthermore remove jacobi test (replaced by kronecker)
|
|
|
0a9f5e9b
|
2019-05-24T10:21:54
|
|
use u32 i64 suffix
|
|
|
b58c9966
|
2019-05-23T23:39:47
|
|
use int32 and uint32 instead of sint and uint
|
|
|
3289c959
|
2019-05-20T10:41:06
|
|
introduce various mp_set_sint/mp_set_uint functions with precise types
|
|
|
5f84f87f
|
2019-05-18T11:12:07
|
|
explicit operator precedence
|
|
|
1af0de1f
|
2019-05-20T19:11:25
|
|
deprecate mp_tc_(and|or|xor) in favor of mp_(and|or|xor)
* same behavior for positive numbers
* generalisation for negative numbers, treating them as two complement
* improve algorithm, iterate once over the digits, manually perform two complement
* simplify mp_add_d, mp_sub_d
* functions are safe in case of a==c or b==c
* renamed mp_tc_div_2d to mp_signed_rsh (signed right shift)
|
|
|
87edbfe4
|
2019-05-19T20:43:42
|
|
ensure that bn_reverse is compiled in bn_deprecated.c
|
|
|
6d84f15e
|
2019-05-19T10:58:04
|
|
remove comment in bn_deprecated
|
|
|
dac8275e
|
2019-05-19T10:55:27
|
|
fix mp_jacobi ifdef
|
|
|
8b2daf78
|
2019-05-19T17:16:13
|
|
always use varname err with mp_err
|
|
|
a8239c24
|
2019-05-13T11:32:42
|
|
deprecate mp_get_bit
The return type of mp_get_bit was imprecise (either mp_err or mp_bool),
therefore this function is deprecated in favor of s_mp_get_bit for now.
If we need s_mp_get_bit to be public, we should add it under a different
name. However since mp_set_bit is not available, I don't think there any
downstream users (ab)using mp_int as bitsets.
|
|
|
56e7a401
|
2019-05-13T02:46:11
|
|
deprecate mp_jacobi
|
|
|
75e85a73
|
2019-05-13T11:18:34
|
|
move mp_prime_random_ex to bn_deprecated.c
|
|
|
885e5e19
|
2019-05-13T11:14:57
|
|
move mp_rand_digit to bn_deprecated.c
|
|
|
4534056c
|
2019-05-13T00:22:18
|
|
use enums mp_err, mp_ord, mp_bool, mp_sign
* MP_USE_ENUMS enables enums
* Wc++-compat catches some implicit conversions if MP_USE_ENUMS is defined
* 100% backwards compatible API/ABI if MP_USE_ENUMS is not defined
|
|
|
fbfcb661
|
2019-04-12T14:56:29
|
|
apply rename
|