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

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

KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers

Open access
De Cannière, Christophe, Dunkelman, Orr, Knežević, Miroslav · 2009 · Lecture Notes in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-642-04138-9_20

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 26 references

Research works printed but not linked: 1

  1. Good, T., Benaissa, M.: Hardware results for selected stream cipher candidates. In: Preproceedings of SASC 2007, pp. 191–204 (2007)

Cited by

See all 693

Metadata

Authors
De Cannière, C., Dunkelman, O., & Knežević, M.
Affiliations
  • Centre National de la Recherche Scientifique (FR)
  • KU Leuven (BE)
Venue
Lecture Notes in Computer Science
Published
2009
Volume
5747
Pages
272-288
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1607874478
Cited by
678
References
26
Citations by year
2026: 9 · 2025: 13 · 2024: 23 · 2023: 30 · 2022: 36 · 2021: 39 · 2020: 44 · 2019: 39 · 2018: 39 · 2017: 58 · 2016: 55 · 2015: 69 · 2014: 52 · 2013: 48 · 2012: 67
FWCI
28.66
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • Lirias (submittedVersion, other-oa)
  • Lecture notes in computer science
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
Keywords
block cipher, lightweight cryptography, RFID tags, hardware resource efficiency, block size, key embedding, encryption throughput

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: KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers. https://app.cochat.ai/papers/10.1007/978-3-642-04138-9_20
The paper
De Cannière, C., Dunkelman, O., & Knežević, M. (2009). KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-04138-9_20

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.