the tower variant of the number field sieve (tnfs) is known to be asymptotically the most efficient algorithm to solve the discrete logarithm problem in finite fields of medium characteristics, when the extension degree is composite. a major obstacle to an efficient implementation of tnfs is the collection of algebraic relations, as it happens in dimensions greater than 2. this requires the construction of new sieving algorithms which remain efficient as the dimension grows. in the work i will present, we overcome this difficulty by considering a lattice enumeration algorithm which we adapt to this specific context. we also consider a new sieving area, a high-dimensional sphere, whereas previous sieving algorithms for the classical nfs considered an orthotope. our new sieving technique leads to a much smaller running time, despite the larger dimension of the search space, and even when considering a larger target, as demonstrated by a record computation we performed in a 521-bit finite field $gf(p^6)$. the target finite field is of the same form as finite fields used in recent zero-knowledge proofs in some blockchains. this is the first reported implementation of tnfs.