Certbot is EFF's tool to obtain certs from Let's Encrypt and (optionally) auto-enable HTTPS on your server. It can also act as a client for any other CA that uses the ACME protocol.
:closed_lock_with_key: multi factor authentication system (2FA, MFA, OTP, FIDO Server)
Self-hosted certificate lifecycle management: issue, renew, discover, inventory and deploy TLS certificates across your infrastructure
Mirror of FreeIPA, an integrated security information management solution
(Python Distribution) A carefully curated collection of Root Certificates for validating the trustworthiness of SSL certificates while verifying the identity of TLS hosts.
Free Active Directory pentesting tool for Linux, macOS and Windows. Automates AD and LDAP enumeration, Kerberoasting, ASREPRoast, password spraying, ADCS/ESC1, DCSync, RBCD, gMSA, shadow credentials, NTLM relay and credential dumping across 104 techniques, mapping BloodHound-compatible attack paths to Domain Admin. NIS2 / ISO 27001 reports.
#1 quality TLS certs while you wait, for the discerning tester
Orchestrate Certbot and Lexicon together to provide Let's Encrypt TLS certificates validated by DNS challenges
Conditional integer multiplication: kappa > 2^-15. Community proofs, exact certificates and reproducible audits; assumes the OpenAI #109 framework.
软件著作权 Skill,自动生成软著申请表、用户手册、技术文档及代码材料,辅助完成软著登记准备。
Tamper-evident tracing, policy gates and cross-checks for AI agents: see what the agent did, and why.
最新微信公众号文章抓取工具,修复7月29号微信公众号接口下架后不能抓取的问题,支持windows、MacOS系统
OpenWrt Xray MITM Domain Fronting service with LuCI certificate management and optional PassWall2 routing
Open-source OSINT panel for WHOIS, IP geolocation, email, and SSL certificate lookups — with a bundled desktop UI.
CVE-2026-54121 - CertiGhost AD CS Multi-Exploit Framework | Rogue DC + LDAP spoofing, certificate abuse, PKINIT hash extraction, auto DCSync. Safe Checker + full exploit, multi-threaded mass scan, Shodan integration, JSON/CSV/JSONL output. CVSS 8.8 High. Use Ethically, Stay Legal :v
Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks