On some uniformity of distribution properties of ESIGN

Edwin El Mahassni; Igor Shparlinski

doi:10.1016/S1571-0653(04)00164-7

On some uniformity of distribution properties of ESIGN

Edwin El Mahassni^*, Igor Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	132-139
Number of pages	8
Journal	Electronic Notes in Discrete Mathematics
Volume	6
DOIs	https://doi.org/10.1016/S1571-0653(04)00164-7
Publication status	Published - Apr 2001
Event	International Workshop on Coding and Cryptography - Paris, France Duration: 8 Jan 2001 → 12 Jan 2001 https://www.rocq.inria.fr/secret/WCC2001/

Access to Document

10.1016/S1571-0653(04)00164-7

Cite this

@article{f6e94dc679464c5daeae07d4514d544c,

title = "On some uniformity of distribution properties of ESIGN",

abstract = "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.",

author = "{El Mahassni}, Edwin and Igor Shparlinski",

year = "2001",

month = apr,

doi = "10.1016/S1571-0653(04)00164-7",

language = "English",

volume = "6",

pages = "132--139",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

note = "International Workshop on Coding and Cryptography, WCC2001 ; Conference date: 08-01-2001 Through 12-01-2001",

url = "https://www.rocq.inria.fr/secret/WCC2001/",

}

TY - JOUR

T1 - On some uniformity of distribution properties of ESIGN

AU - El Mahassni, Edwin

AU - Shparlinski, Igor

PY - 2001/4

Y1 - 2001/4

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

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

UR - http://www.scopus.com/inward/record.url?scp=34247109699&partnerID=8YFLogxK

U2 - 10.1016/S1571-0653(04)00164-7

DO - 10.1016/S1571-0653(04)00164-7

M3 - Article

AN - SCOPUS:52549089156

SN - 1571-0653

VL - 6

SP - 132

EP - 139

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

T2 - International Workshop on Coding and Cryptography

Y2 - 8 January 2001 through 12 January 2001

ER -

On some uniformity of distribution properties of ESIGN

Abstract

Access to Document

Other files and links

Fingerprint

Cite this