The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
How to Protect DES Against Exhaustive Key Search
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“The modeling of a block cipher by a family of random permutations has its roots in [ 13 ].”
MethodSpecial Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
Borghoff, J., Canteaut, A., Güneysu, T., Kavun, E. B., Knezevic, M., Knudsen, L. R., Leander, G., Nikov, V., Paar, C., Rechberger, C., et al. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-34961-4_14 · Cited by 750
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Self-citationThe SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
Beierle, C., Jean, J., Kölbl, S., Leander, G., Moradi, A., Peyrin, T., Sasaki, Y., Sasdrich, P., & Sim, S. M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53008-5_5 · Cited by 689
Liskov, M., Rivest, R. L., & Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_3 · Cited by 468
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (2013) · Journal of Cryptology · doi:10.1007/s00145-011-9114-1 · Cited by 402
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
Black, J., Rogaway, P., & Shrimpton, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_21 · Cited by 337
Self-citationSignature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357847 · Cited by 325
Data Encryption Standard (DES)
Biryukov, A., & De Cannière, C. (2011) · Encyclopedia of Cryptography and Security · doi:10.1007/978-1-4419-5906-5_568 · Cited by 317
Survey and benchmark of block ciphers for wireless sensor networks
Law, Y. W., Doumen, J., & Hartel, P. (2006) · ACM Transactions on Sensor Networks · doi:10.1145/1138127.1138130 · Cited by 290
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
Naor, M., & Reingold, O. (1999) · Journal of Cryptology · doi:10.1007/pl00003817 · Cited by 285
Halevi, S., & Rogaway, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_28 · Cited by 261
Self-citationA randomized comparison of online and paper mood charts for people with bipolar disorder
Lieberman, D. Z., Kelly, T. F., Douglas, L., & Goodwin, F. K. (2010) · Journal of Affective Disorders · doi:10.1016/j.jad.2009.10.019 · Cited by 42
“The only piece of identifying information that was stored online was the email address, which was encrypted using the triple DES algorithm (Data Encryption Standard) (Kilian and Rogaway, 1996).”
Method
Metadata
- Authors
- Kilian, J., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 252-267
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1801417685
- Cited by
- 187
- References
- 2
- FWCI
- 9.27
- 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.