cryptography

Analyze cryptographic challenges to identify exploitable weaknesses in ciphers and protocols.

3|1|Updated May 26, 2026
One-click install
npx skills add https://github.com/LeoWSY-hashblue/-communitytools-custom --skill cryptography-leowsy-hashblue
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: cryptography
Source: https://github.com/LeoWSY-hashblue/-communitytools-custom/tree/main/skills/cryptography
Command: npx skills add https://github.com/LeoWSY-hashblue/-communitytools-custom --skill cryptography-leowsy-hashblue

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Cryptography problems are solved by identifying structural weaknesses in cryptosystems and translating them into actionable attacks that can recover keys, plaintext, or parameters with rigorous verification.

Core Features & Use Cases

  • Lattice-based patterns (AGCD, discriminant-square factoring) for modulus and prime recovery.
  • Differential and differential fault analysis (DFA) for AES and RSA-like schemes.
  • Secret sharing reconstructions under non-prime moduli and related attacks.
  • Reference-driven learning: maps to scenario files and practical exercises.

Quick Start

Review the cryptography references and reproduce a sample attack pattern (e.g., AGCD or lattice-based factoring) on a controlled dataset.

Frequently Asked Questions about cryptography

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
What is a differential fault attack on AES and RSA?

Differential fault analysis (DFA) on AES and RSA recovers cryptographic keys by injecting faults into cipher computations and analyzing the faulty outputs. This skill provides reference-driven attack patterns for identifying these exploitable implementation weaknesses.

How do I perform lattice-based attacks for modulus and prime recovery?

Perform lattice-based attacks for modulus and prime recovery by applying AGCD factoring patterns and discriminant-square techniques to controlled datasets. This skill provides practical Python-based implementations and reference exercises to validate the recovered parameters.

Can I use Python to implement cryptographic cryptanalysis on controlled datasets?

Yes, you can use Python to implement cryptanalysis on controlled datasets. This skill emphasizes understanding pure-Python tooling for cryptographic attacks and validating recovered keys, plaintext, or parameters against published reference materials.

Does this approach support secret sharing reconstructions under non-prime moduli?

Yes, this approach supports secret sharing reconstructions under non-prime moduli. It identifies structural weaknesses in secret sharing schemes and translates them into actionable attacks to recover parameters with rigorous verification.

What is the best way to validate recovered cryptographic parameters against published references?

The best way to validate recovered cryptographic parameters is to reproduce sample attack patterns like AGCD or lattice-based factoring on controlled datasets and compare results with published references. This skill maps scenarios to practical exercises for verification.