The DOI matches its Crossref record.
Breaking 104 Bit WEP in Less Than 60 Seconds
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Practical attacks against WEP and WPA
Tews, E., & Beck, M. (2009) · Proceedings of the second ACM conference on Wireless network security · doi:10.1145/1514274.1514286 · Cited by 257
Self-citationKey Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., & Shamir, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_15 · Cited by 185
A Comprehensive Attack Flow Model and Security Analysis for Wi-Fi and WPA3
Kohlios, C. P., & Hayajneh, T. (2018) · Electronics · doi:10.3390/electronics7110284 · Cited by 77
“However, WEP has been 163 proven to be easily broken [7][9][8].”
BackgroundRelease the Kraken: New KRACKs in the 802.11 Standard
Vanhoef, M., & Piessens, F. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243807 · Cited by 57
(2012) · Cited by 17
Metadata
- Authors
- Tews, E., Weinmann, R.-P., & Pyshkin, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- Pages
- 188-202
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1789460706
- Cited by
- 199
- References
- 0
- FWCI
- 14.53
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Breaking 104 Bit WEP in Less Than 60 Seconds. https://app.cochat.ai/papers/10.1007/978-3-540-77535-5_14
- The paper
- Tews, E., Weinmann, R.-P., & Pyshkin, A. (2007). Breaking 104 Bit WEP in Less Than 60 Seconds. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-77535-5_14
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.
