SWI-Prolog -- crypto_generate_prime/3

SWI-Prolog Did You Know Did you know? SWI-Prolog has a pack to access Pubmed Data

Search Documentation:

Predicate crypto_generate_prime/3

HOME
DOWNLOAD
DOCUMENTATION
- Manual
- Packages
- FAQ
- Command line
- PlDoc
- Bluffers▶
- License
- Publications
- Rev 7 Extensions
TUTORIALS
- Beginner▶
- Advanced▶
- Web applications▶
- Semantic web▶
  - ClioPatria
  - RDF namespaces
- Graphics▶
  - XPCE
  - GUI options
- Machine learning▶
  - Probabilistic Logic Programming
- External collections▶
  - Meta level tutorials
- For packagers▶
  - Linux packages
COMMUNITY
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)

Source

[det]crypto_generate_prime(+N, -P, +Options)

Generate a prime P with at least N bits. Options is a list of options. Currently, the only supported option is:

safe(Boolean): If Boolean is true (default is false), then a safe prime is generated. This means that P is of the form 2*Q + 1 where Q is also prime.