On the Security o Lenstra’ s Variant o DSA without Long Inversions

Abstract

Abstract. 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.