Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Clarify BN_mod_exp docs (1.1.0/1.0.2) #6138

Closed
wants to merge 2 commits into from
Closed

Clarify BN_mod_exp docs (1.1.0/1.0.2) #6138

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
2073acd
Clarify BN_mod_exp docs
mattcaswell Apr 30, 2018
997c544
fixup! Clarify BN_mod_exp docs
mattcaswell May 1, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
4 changes: 3 additions & 1 deletion doc/crypto/BN_add.pod
View file
Open in desktop
Expand Up @@ -92,7 +92,9 @@ BN_exp() raises I<a> to the I<p>-th power and places the result in I<r>
BN_mul().

BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
m>). This function uses less time and space than BN_exp().
m>). This function uses less time and space than BN_exp(). Do not call this
function when B<m> is even and any of the parameters have the
B<BN_FLG_CONSTTIME> flag set.

BN_gcd() computes the greatest common divisor of I<a> and I<b> and
places the result in I<r>. I<r> may be the same B<BIGNUM> as I<a> or
Expand Down