The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cryptanalysis of LOKI 91
Open accessAbstract
In 1990 Brown, Pieprzyk and Seberry proposed a new encryption primitive, which encrypts and decrypts a 64-bit block of data using a 64-bit key. Furthermore they propose a way to build private versions of LOKI. In this paper we show first that the keyspace of any LOKI-version is only 2^60, not 2^64 as claimed. Therefore there are 15 equivalent keys for every key, that encrypts/decrypts texts the same way. An immediate consequence is, that for the proposed Single Block Hash Mode it is very easy to find collisions. Secondly we do differential cryptanaiysis on LOKI and show that n-round LOKI, n<=14 is vulnerable to this kind of attack, at least in principle. We show that we cannot find a characteristic with a probability high enough to break LOKI with 16 rounds. However one might find a private LOKI-version, that is vulnerable to a differential attack for n=16. Finally we consider differentials versus characteristics for LOKI.
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
Cites
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
New types of cryptanalytic attacks using related keys
Biham, E. (1994) · Journal of Cryptology · doi:10.1007/bf00203965 · Cited by 473
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., & Tokita, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44983-3_4 · Cited by 447
Key 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
Metadata
- Authors
- Knudsen, L. R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1993
- Volume
- 21
- Issue
- 403
- Pages
- 196-208
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1543271574
- Cited by
- 178
- References
- 1
- FWCI
- 2.67
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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: Cryptanalysis of LOKI 91. https://app.cochat.ai/papers/10.1007/3-540-57220-1_62
- The paper
- Knudsen, L. R. (1993). Cryptanalysis of LOKI 91. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-57220-1_62
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.
