skills.rest
utsavthakur
utsavthakurCOMMUNITY
Explore all skills by this author →
GitHub

lattice-crypto-attacks

Solve RSA, DSA/ECDSA, knapsack, and NTRU problems using lattice-based techniques.

Updated Jun 11, 2026
Search Tags:#RSA#DSA/ECDSA#lattice-based cryptography#knapsack attack#NTRU
One-click install
npx skills add https://github.com/utsavthakur/agenticskills --skill lattice-crypto-attacks-utsavthakur
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: lattice-crypto-attacks
Source: https://github.com/utsavthakur/agenticskills/tree/main/lattice-crypto-attacks
Command: npx skills add https://github.com/utsavthakur/agenticskills --skill lattice-crypto-attacks-utsavthakur

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires sage, fpylll, and includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill unit offers expert-level lattice-based cryptanalysis tools for tackling complex cryptographic attacks and analysis, including RSA, DSA/ECDSA, knapsack problems, and more.

Core Features & Use Cases

  • RSA Cryptanalysis: Solves RSA problems via Coppersmith's method, including small roots and private exponent d recovery.
  • DSA/ECDSA Nonce Recovery: Recovers nonces from bias using the Hidden Number Problem.
  • Knapsack Attack: Solves knapsack problems for low-density instances.
  • NTRU Key Recovery: Recovers keys from NTRU lattices.
  • Use Case: Utilize this Skill in a cybersecurity context for advanced cryptanalysis, such as breaking RSA via small roots or recovering ECDSA nonces.

Quick Start

Load the lattice-crypto-attacks skill to perform Coppersmith's method on an RSA problem with a known small root.

Frequently Asked Questions about lattice-crypto-attacks

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

FAQPage Schema
How do I recover an RSA private exponent using Coppersmith's method?▼

To solve RSA via Coppersmith's method, the Skill computes small roots of polynomial equations to recover the private exponent d. It requires sage and fpylll for the mathematical operations and lattice reduction algorithms.

Can I recover ECDSA nonces from signature bias?▼

Yes, you can recover DSA/ECDSA nonces from bias by solving the Hidden Number Problem. This Skill applies lattice reduction techniques to extract secret nonces from biased DSA or ECDSA signatures.

Do I need sage and fpylll installed to run lattice-based cryptanalysis?▼

Yes, sage and fpylll are required dependencies for this Skill. They provide the mathematical operations and reduction algorithms necessary to execute NTRU key recovery, knapsack attacks, and Coppersmith's method.

What is the best way to solve low-density knapsack problems?▼

The best way to solve low-density knapsack problems is by mapping the problem to a lattice and applying reduction algorithms. This Skill solves knapsack instances using fpylll to find the target vector and recover the underlying set.

Does this Skill support NTRU key recovery attacks?▼

Yes, this Skill supports NTRU key recovery. It performs NTRU key recovery by applying lattice-based techniques to analyze NTRU lattices and extract the private key from the public parameters.

Related Skills

Explore More Software Engineering Skills→
zaiyemeiyou404zaiyemeiyou404

ctf-crypto-attacks

Solve CTF cryptographic challenges involving RSA, elliptic curves, and lattices.

Community
Advanced
ovachieverovachiever
52

sympy

Solve symbolic mathematics problems in Python using SymPy.

Community
Advanced
lNwNllNwNl

lattice-crypto-attacks

Applies LLL/BKZ lattice reduction and Coppersmith methods to cryptanalyze RSA, DSA/ECDSA, and knapsack ciphers.

Community
Advanced
asdfgh1445asdfgh1445
735

ctf-crypto

Solve CTF cryptographic challenges with lattice reduction and modular arithmetic.

Community
Advanced