Showing 3 open source projects for "modular"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • G-P - Global EOR Solution Icon
    G-P - Global EOR Solution

    Companies searching for an Employer of Record solution to mitigate risk and manage compliance, taxes, benefits, and payroll anywhere in the world

    With G-P's industry-leading Employer of Record (EOR) and Contractor solutions, you can hire, onboard and manage teams in 180+ countries — quickly and compliantly — without setting up entities.
    Learn More
  • 1
    PureBasic Shamir Secret Sharing

    PureBasic Shamir Secret Sharing

    Open-source PureBasic implementation of the Shamir Secret Sharing

    ...Main Features Complete implementation of Shamir Secret Sharing Arithmetic over GF(257) Compatible with all character strings Robust Lagrange interpolation Safe modular inverse computation Shares encoded in hexadecimal (3 characters per byte) Clear, well-commented source code ⚠️ Disclaimer This project is intended for educational and demonstration
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Brute is a brute force hash cracker, it allows the user to specify how many threads he want running simultaneously. It is fast, and modular, all the hash algorithm dependent code lies in a module (a shared library). Modules available: MD5; SHA256; SHA512
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    TXTCOD encodes and decodes any type of file with a modular algorithm named SAC.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next