code documentation
This commit is contained in:
parent
7d0d0996aa
commit
124d8cf701
@ -254,7 +254,8 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
|
|||||||
while (!BN_is_zero(B))
|
while (!BN_is_zero(B))
|
||||||
{
|
{
|
||||||
/*
|
/*
|
||||||
* 0 < B < A <= |n|,
|
* 0 < B < |n|,
|
||||||
|
* 0 < A <= |n|,
|
||||||
* (1) -sign*X*a == B (mod |n|),
|
* (1) -sign*X*a == B (mod |n|),
|
||||||
* (2) sign*Y*a == A (mod |n|)
|
* (2) sign*Y*a == A (mod |n|)
|
||||||
*/
|
*/
|
||||||
@ -299,13 +300,16 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* We still have (1) and (2), but A may no longer be larger than B.
|
/* We still have (1) and (2).
|
||||||
* Both A and B are odd.
|
* Both A and B are odd.
|
||||||
* The following computations ensure that
|
* The following computations ensure that
|
||||||
*
|
*
|
||||||
* 0 =< B < A = |n|,
|
* 0 <= B < |n|,
|
||||||
|
* 0 < A < |n|,
|
||||||
* (1) -sign*X*a == B (mod |n|),
|
* (1) -sign*X*a == B (mod |n|),
|
||||||
* (2) sign*Y*a == A (mod |n|)
|
* (2) sign*Y*a == A (mod |n|),
|
||||||
|
*
|
||||||
|
* and that either A or B is even in the next iteration.
|
||||||
*/
|
*/
|
||||||
if (BN_ucmp(B, A) >= 0)
|
if (BN_ucmp(B, A) >= 0)
|
||||||
{
|
{
|
||||||
|
@ -12,13 +12,13 @@
|
|||||||
|
|
||||||
|
|
||||||
IFS=:
|
IFS=:
|
||||||
try_path=true
|
try_without_dir=true
|
||||||
# First we try "bc", then "$dir/bc" for each item in $PATH.
|
# First we try "bc", then "$dir/bc" for each item in $PATH.
|
||||||
for dir in dummy:$PATH; do
|
for dir in dummy:$PATH; do
|
||||||
if [ "$try_path" = true ]; then
|
if [ "$try_without_dir" = true ]; then
|
||||||
# first iteration
|
# first iteration
|
||||||
bc=bc
|
bc=bc
|
||||||
try_path=false
|
try_without_dir=false
|
||||||
else
|
else
|
||||||
# second and later iterations
|
# second and later iterations
|
||||||
bc="$dir/bc"
|
bc="$dir/bc"
|
||||||
|
Loading…
Reference in New Issue
Block a user