Showing 3 open source projects for "penetration testing"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 1
    assetfinder

    assetfinder

    Find domains and subdomains related to a given domain

    ...It queries services such as certificate transparency logs, threat intelligence platforms, and passive DNS providers to build a comprehensive list of related assets. The tool is widely used in bug bounty programs and penetration testing to map an organization’s external attack surface. It supports optional filtering to return only subdomains, allowing users to focus on specific reconnaissance needs. assetfinder is lightweight and easy to use, typically requiring only a single command to produce results, making it ideal for quick enumeration tasks. Its modular design allows contributors to add new data sources, improving coverage over time.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    Primes

    Calculate primes by using extremely fast sorting

    This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Optimum Path Calculator
    Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next