Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 191

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Elligator: elliptic-curve points indistinguishable from uniform random strings

Open access
Bernstein, Daniel J., Hamburg, Mike, Krasnova, Anna, Lange, Tanja·2013·Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13

Abstract

Censorship-circumvention tools are in an arms race against censors. The censors study all traffic passing into and out of their controlled sphere, and try to disable censorship-circumvention tools without completely shutting down the Internet. Tools aim to shape their traffic patterns to match unblocked programs, so that simple traffic profiling cannot identify the tools within a reasonable number of traces; the censors respond by deploying firewalls with increasingly sophisticated deep-packet inspection. Cryptography hides patterns in user data but does not evade censorship if the censor can recognize patterns in the cryptography itself. In particular, elliptic-curve cryptography often transmits points on known elliptic curves, and those points are easily distinguishable from uniform random strings of bits.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2508859.2516734

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 191

Metadata

Authors
Bernstein, D. J., Hamburg, M., Krasnova, A., & Lange, T.
Venue
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
Publisher
ACM Press
Published
2013
Volume
2013
Pages
967-980
OpenAlex
W2122087485
Cited by
191
References
2
FWCI
6.72
Type
conference paper
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Elligator: elliptic-curve points indistinguishable from uniform random strings. https://app.cochat.ai/papers/10.1145/2508859.2516734
The paper
Bernstein, D. J., Hamburg, M., Krasnova, A., & Lange, T. (2013). Elligator: elliptic-curve points indistinguishable from uniform random strings. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13. https://doi.org/10.1145/2508859.2516734

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.