On the security of Lenstra's variant of DSA without long inversions

We use bounds of exponential sums to show that, for a wide class of parameters, the modification of the digital signature algorithm (DSA) scheme proposed by A.K. Lenstra (see Proc. Asiacrypt'96, Lect. Notes in Comp. Sci., vol.1163, p.57-64, 1996) is as secure as the original schem

On the security of Lenstra's variant of DSA without long inversions

We use bounds of exponential sums to show that for a wide class of parameters the modification of the DSA signature scheme proposed by A.K. Lenstra at Asiacrypt '96 is as secure as the original scheme