We use bounds of exponential sums to establish some attractive uniformity of distribution properties of ESIGN. In particular, this implies that the brute force attack is very unlikely to succeed. This fact has never been doubted in practice but out results provide its first rigorous proof.
|Number of pages||8|
|Journal||Electronic Notes in Discrete Mathematics|
|Publication status||Published - Apr 2001|
|Event||International Workshop on Coding and Cryptography - Paris, France|
Duration: 8 Jan 2001 → 12 Jan 2001