The DOI matches its Crossref record.
A fast new DES implementation in software
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
Cache Attacks and Countermeasures: The Case of AES
Osvik, D. A., Shamir, A., & Tromer, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/11605805_1 · Cited by 1,352
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Courtois, N. T. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_11 · Cited by 904
Selecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2001) · Journal of Cryptology · doi:10.1007/s00145-001-0009-4 · Cited by 784
Algebraic Attacks on Stream Ciphers with Linear Feedback
Courtois, N. T., & Meier, W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_21 · Cited by 567
Efficient Cache Attacks on AES, and Countermeasures
Tromer, E., Osvik, D. A., & Shamir, A. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9049-y · Cited by 444
Malware Guard Extension: Using SGX to Conceal Cache Attacks
Schwarz, M., Weiser, S., Gruss, D., Maurice, C., & Mangard, S. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-60876-1_1 · Cited by 339
Selecting Cryptographic Key Sizes: Extended Abstract
Lenstra, A. K., & Verheul, E. R. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_30 · Cited by 265
Faster and Timing-Attack Resistant AES-GCM
Käsper, E., & Schwabe, P. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04138-9_1 · Cited by 265
(2009) · IACR Cryptology ePrint Archive · Cited by 64
Fast AES Implementation: A High-Throughput Bitsliced Approach
Hajihassani, O., Monfared, S. K., Khasteh, S. H., & Gorgin, S. (2019) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2911278 · Cited by 60
Implementation of Bitsliced AES Encryption on CUDA-Enabled GPU
Nishikawa, N., Amano, H., & Iwai, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-64701-2_20 · Cited by 42
Exploring Bitslicing Architectures for Enabling FHE-Assisted Machine Learning
Sinha, S., Saha, S., Alam, M., Agarwal, V., Chatterjee, A., Mishra, A., Khazanchi, D., & Mukhopadhyay, D. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3204909 · Cited by 4
Metadata
- Authors
- Biham, E.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Pages
- 260-272
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1548516269
- Cited by
- 328
- References
- 0
- FWCI
- 6.70
- 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
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.