Showing 3 open source projects for "hash data"

View related business solutions
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Veeam Data Platform v13.1 Icon
    Veeam Data Platform v13.1

    Move workloads across hypervisors and clouds with no vendor lock-in. Try VDP free today.

    Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
    Try Now
  • 1

    64-bit prime test

    Test 64-bit integers for pribality. Miller-Rabin, Lucas. BPSW

    ...As values get larger it uses up to two more Miller Rabin rounds, and at the end it uses BPSW (which is one rould of Miller Rabin and then one of Lucas). Compared to other codes that achieve the same I believe that the hash tables used here are compact, and both the programs and the intermediate data used to create them are provided. This may be of interest just to people wanting a C++ implementation of the Lucas test.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    CryptoDock

    CryptoDock

    CryptoDock is a tool that hosts various crypto. algorithms.

    CryptoDock is free multi-platform application written in Java that hosts various hash and modern cryptographic algorithms you can use to protect your sensitive data on your computer. Available cryptographic algorithms: 1. NLSE-1 2. One Time Pad 3. AES Available hashing algorithms: 1. MD5 2. SHA-1 3. SHA-256 4. SHA-512 IMPORTANT: In order to run CryptoDock you need to have Java installed on your computer.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    DimerRemover

    Remove adapter dimers from NGS data

    This program can be used to count or remove adapter dimers in fastq files. Using a provided adapter sequence, it generates variations of this sequence and stores them in a hash table. The reads can then be directly matched against the hash. It is far more time efficient than doing alignment.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next