Cryptograaf Léo Ducas (CWI Amsterdam) schreef hierover op 6 maart j.l. in
https://github.com/lducas/SchnorrGate onder meer:
Personal study (unfortunately, never written down cleanly) of this approach suggested me that this approach requires solving SVP in dimensions beyond reasonable, leading to a factorization algorithm much slower than the state of the art. My impression is that this is the consensus among experts having spent some time on it as well.