Skip to content
KitploitKITPLOIT
أدواتعمليات الاستغلالالمدونة
Log in
إرسال
أدواتعمليات الاستغلالالمدونة
إرسال

أدوات الاختراق واختبار الاختراق والأمن السيبراني لترسانتك الأمنية!

Kitploit هو دليل لأدوات الاختراق والأمن السيبراني واختبار الاختراق. اكتشف آخر تحديثات المشاريع للعثور على الثغرات وتحليل الأنظمة وأتمتة الاختبارات وتعزيز أمنك.

الخلاصاتاتصالالخصوصية© 2026 Kitploit

دليل الأدوات

الفئات

عرض جميع الفئات
Loading categories
أدوات/GitHubGitHub/chakshugupta13/lab
Hash AnalysisCryptographyPapers & ResearchLearning & EducationCurated Resources
GitHubchakshugupta13/lab

lab

Code artifacts from research paper implementations

عرض المستودع
22منذ 6س 9دلم تتم المراجعة بعد
مشاركة
المحتوى غير متوفر باللغة المطلوبة. عرض النسخة الإنجليزية.

Lab

Public code artifacts from research work.

Papers

Implementations and supporting code for specific research papers.

alife

AnchorDescription
gupta2026leniaCollision-based logic in Lenia and its composition boundary — an emergent INHIBIT gate and AND-NOT cascade from Orbium glider collisions, plus the measured boundary to general composition (arXiv:2609.01348)

energy

AnchorDescription
gupta2026exergyNumerical verification of sharp exergy-correction bounds for selective absorbers under linear allocation

math

AnchorDescription
gupta2026architectureArchitecture-induced recoverability bias in differentiable symbolic regression (arXiv:2604.23256, MLSP 2026)
gupta2026origamiDegree sequence and diameter of the $m\times n$ Miura-ori origami flip graph, via height functions (arXiv:2606.22614)
gupta2026degseqMiura-ori degree counting with a portable partial Lean formalization of the total-degree theorem, low-degree cases and signed counts (arXiv:2607.05567)
gupta2026saturationThe saturation number is not bounded by the harmonic index (arXiv:2606.15761) — refutation of TxGraffiti Conjecture 4 (arXiv:2507.17780)
gupta2026annihilationSharp annihilation-number Caro–Wei bound and proof of TxGraffiti Conjecture 1 for connected graphs with at least three vertices, including all eight equality graphs (arXiv:2606.29553)
gupta2026edgedominationDomination number at most edge domination number for regular graphs of degree at least seven, via the Lovász Local Lemma (arXiv:2608.22498) — the previously open range of a conjecture of Baste et al. (arXiv:1906.10420); submitted to Graphs and Combinatorics

cryptanalysis

AnchorDescription
sanadhya200822- and 24-step SHA-256 collision attacks
mendel201127/32-step SHA-256 collisions via SAT + novel findings (32K collision family, 10× phase-seed speedup, W[7] characterization)
mendel2013improving28/31/38-step SHA-256 collisions via SAT on dense characteristics
eichlseder201438-step SHA-512 SFS collision via SAT + GnD plateau analysis
lamberger201146-step SHA-256 second-order differential: message-modification analysis (two-layer decomposition, revised 2⁴⁷·⁶ complexity)
de2006finding-workfactorSHA-1 work-factor calculator (De Cannière–Rechberger 2006 §III-C), first independent reimplementation
gupta2026rankRank ceiling for twiddle-perturbation faults on the forward NTT of ML-KEM and ML-DSA (ePrint 2026/1188, arXiv:2610.30383)
zhang2026-verificationSFS collision verification + corrected Table 8 characteristic for Zhang–Li–Gao–Wang, EUROCRYPT 2026

Tools

Stand-alone utilities not tied to a single paper. Organized by domain.

ai

ToolDescription
learning-pipelineReference pipeline that improves an editor-embedded AI assistant's configuration from one user's implicit corrections — six structural detectors plus an L2 semantic miner, human-gated instruction edits, and effectiveness tracking

quantum

ToolDescription
qbudgetReport T-count and AND-uncomputation accounting for compute-uncompute Grover oracles in Qiskit or Q#
تنزيل الأداة

الأكثر شعبية

عرض الكل →

اكتشف الأدوات الأكثر استخدامًا من قبل مجتمعنا.

لا توجد بيانات شعبية بعد.

استكشف جميع الأدوات

تصفح مجموعتنا من الأدوات

عرض جميع الأدوات →