The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
HIGHT: A New Block Cipher Suitable for Low-Resource Device
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Differential Cryptanalysis of the Data Encryption Standard
Biham, E., & Shamir, A. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9314-6 · Cited by 1,054
Advances in Cryptology — EUROCRYPT ’99
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x · Cited by 902
Fischlin, M., & Coron, J.-S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5 · Cited by 882
Daemen, J., Knudsen, L. R., & Rijmen, V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052343 · Cited by 741
Truncated and higher order differentials
Knudsen, L. R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_16 · Cited by 731
Strong Authentication for RFID Systems Using the AES Algorithm
Feldhofer, M., Dominikus, S., & Wolkerstorfer, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_26 · Cited by 715
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
Courtois, N. T., & Pieprzyk, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_17 · Cited by 688
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5 · Cited by 681
(2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7 · Cited by 620
(2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3 · Cited by 613
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Biham, E., Biryukov, A., & Adi Shamir, Z. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_2 · Cited by 582
Wagner, D. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48519-8_12 · Cited by 576
(2004) · Lecture notes in computer science · doi:10.1007/b99451 · Cited by 523
Iwata, T., & Cheon, J. H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48800-3 · Cited by 476
New types of cryptanalytic attacks using related keys
Biham, E. (1994) · Journal of Cryptology · doi:10.1007/bf00203965 · Cited by 473
The First Experimental Cryptanalysis of the Data Encryption Standard
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_1 · Cited by 416
AES implementation on a grain of sand
Feldhofer, M., Wolkerstorfer, J., & Rijmen, V. (2005) · IEE Proceedings - Information Security · doi:10.1049/ip-ifs:20055006 · Cited by 376
Biryukov, A., & Wagner, D. A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48519-8_18 · Cited by 320
The interpolation attack on block ciphers
Jakobsen, T., & Knudsen, L. R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052332 · Cited by 298
The Rectangle Attack — Rectangling the Serpent
Biham, E., Dunkelman, O., & Keller, N. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_21 · Cited by 284
Biryukov, A., & Wagner, D. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_41 · Cited by 246
Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent
Kelsey, J. M., Kohno, T., & Schneier, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_6 · Cited by 224
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Biham, E., Biryukov, A., & Adi Shamir, Z. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0129-3 · Cited by 207
New Results on Boomerang and Rectangle Attacks
Biham, E., Dunkelman, O., & Keller, N. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45661-9_1 · Cited by 112
The Saturation Attack — A Bait for Twofish
Lucks, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45473-x_1 · Cited by 88
Cited by
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867
Guo, J., Peyrin, T., Poschmann, A., & Robshaw, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_22 · Cited by 773
KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
De Cannière, C., Dunkelman, O., & Knežević, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04138-9_20 · Cited by 678
Thakor, V. A., Razzaque, M. A., & Khandaker, M. R. A. (2021) · IEEE Access · doi:10.1109/access.2021.3052867 · Cited by 424
KLEIN: A New Family of Lightweight Block Ciphers
Gong, Z., Nikova, S., & Law, Y. W. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25286-0_1 · Cited by 405
Metadata
- Authors
- Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.-S., Lee, C., Chang, D., Lee, J., Jeong, K., Kim, H., Kim, J., & Chee, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 46-59
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1522919234
- Cited by
- 708
- References
- 30
- FWCI
- 11.05
- 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.
