Did you know ...
Search Documentation:
Predicate crypto_modular_inverse/3
HOME
DOWNLOAD
SWI-Prolog
Sources/building
Docker images
Add-ons
Browse GIT
DOCUMENTATION
Manual
Packages
FAQ
Command line
PlDoc
Bluffers
▶
Prolog syntax
PceEmacs
HTML generation
License
Publications
Rev 7 Extensions
TUTORIALS
Beginner
▶
Getting started
Learn Prolog Now!
Simply Logical
Debugger
Development tools
Advanced
▶
Modules
Grammars (DCGs)
clp(fd)
Printing messages
PlDoc
Web applications
▶
Web applications
Let's Encrypt!
Pengines
Semantic web
▶
ClioPatria
RDF namespaces
Graphics
▶
XPCE
GUI options
Machine learning
▶
Probabilistic Logic Programming
External collections
▶
Meta level tutorials
For packagers
▶
Linux packages
COMMUNITY
IRC
Forum & mailing list
Blog
News
Report a bug
Submit a patch
Submit an add-on
Roadmap (on GitHub)
External links
Contributing
Code of Conduct
Contributors
SWI-Prolog items
COMMERCIAL
WIKI
Login
View changes
Sandbox
Wiki help
All tags
Documentation
Reference manual
Packages
SWI-Prolog SSL Interface
library(crypto): Cryptography and authentication library
Number theory
crypto_modular_inverse/3
crypto_generate_prime/3
crypto_is_prime/2
Availability:
:- use_module(
library(crypto)
).
(can be autoloaded)
[det]
crypto_modular_inverse
(
+X, +M, -Y
)
Compute the modular multiplicative inverse of the integer
X
.
Y
is unified with an integer such that
X
*
Y
is congruent to 1 modulo
M
.