Skip to content

Latest commit

 

History

History
16 lines (9 loc) · 688 Bytes

File metadata and controls

16 lines (9 loc) · 688 Bytes

A complex number

  • Category: Crypto
  • Solves: 0/52

Description

A random complex number probably won't tell you anything about the key right?

Solution

It is similar to the example given in the Applications in Lenstra–Lenstra–Lovász lattice basis reduction algorithm on Wikipedia.

The example only show how to solve it when $r$ is a real number, but it is easy to extend it to complex numbers by taking the real part and imaginary part seperately. Construct the basis and the first row will be the AES key.

Solver: solve.sage