fundno aff
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time2001· article· en· Mathematics of Computation· Computer Science
64
citations
Every work in the frame. Each row carries the routes that admitted it, because a frame that forgets how it found something cannot be audited.