lattice-crypto-attacks

RSA private key recovery uses Coppersmith's method to find small roots of polynomials derived from the RSA modulus and public exponent. This Skill applies LLL or BKZ lattice reduction to compute those small roots and recover the key.

Yes, DSA/ECDSA nonce recovery from biased signatures is achieved by solving the Hidden Number Problem. This Skill constructs a lattice from the biased nonce values and uses lattice reduction to recover the secret signing key.

Low-density knapsack ciphers are attacked by applying lattice reduction techniques to the underlying subset sum problem. This Skill builds a lattice from the public key weights and uses LLL reduction to find the plaintext bits.

Truncated Linear Congruential Generator output is solved by formulating a Closest Vector Problem on a recurrence lattice. This Skill constructs the lattice from consecutive truncated outputs and applies reduction to recover the full internal state.

Yes, NTRU key recovery requires understanding of lattice theory and specific reduction algorithms. This Skill reduces the NTRU lattice constructed from public parameters to recover the private key, but expects expert-level cryptanalysis knowledge.

The Boneh-Durfee attack is used for RSA when the private exponent d is small, whereas Coppersmith's method targets small message roots or partial key exposure. This Skill provides techniques for both scenarios to handle various RSA vulnerabilities.