CoChat
Sign Up
Cited by 110Cryptographic Implementations and SecurityCoding theory and cryptographyCryptography and Residue Arithmetic

Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others

Open access
Biryukov, Alex, Nikolić, Ivica·2010·Lecture Notes in Computer Science
DOI 10.1007/978-3-642-13190-5_17
Open this paper in CoChat — free accountOpen PDF

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-642-13190-5_17

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • The analysis of AES with local collisions is only applicable to the related-key model.

    “So far the most well-known attempt is the analysis of AES with local collisions [8][9][10][11], but it is only applicable to the relatedkey model.”

    From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [11]

    The Introduction describes related-key differential analysis of AES, including characteristics used in an AES-256 attack. It does not identify that analysis as using local collisions or say that local-collision analysis of AES is only applicable in the related-key model. (LLM, conf=0.78)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 27

  1. K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, J. Nakajima, and T. Tokita. Camellia: A 128-bit block cipher suitable for multiple platforms -design and analysis. In D. R. Stinson and S. E. Tavares, editors, Selected Areas in Cryptography, volume 2012 of Lecture Notes in Computer Science, pages 39-56. Springer, 2000.
  2. E. Biham. New types of cryptanalytic attacks using related keys. J. Cryptology, 7(4):229-246, 1994.
  3. E. Biham, O. Dunkelman, and N. Keller. Related-key boomerang and rectangle attacks. In R. Cramer, editor, EUROCRYPT, volume 3494 of Lecture Notes in Computer Science, pages 507-525. Springer, 2005.
  4. A. Biryukov. Analysis of involutional ciphers: Khazad and Anubis. In T. Johansson, editor, FSE, volume 2887 of Lecture Notes in Computer Science, pages 45-53. Springer, 2003.
  5. M. Matsui, editor, ASIACRYPT, volume 5912 of Lecture Notes in Computer Science, pages 1-18. Springer, 2009.
  6. In S. Halevi, editor, CRYPTO, volume 5677 of Lecture Notes in Computer Science, pages 231-249. Springer, 2009.
  7. C. D. Cannière and C. Rechberger. Finding SHA-1 characteristics: General results and applications. In X. Lai and K. Chen, editors, ASIACRYPT, volume 4284 of Lecture Notes in Computer Science, pages 1-20. Springer, 2006.
  8. D. R. Chowdhury, V. Rijmen, and A. Das, editors. Progress in Cryptology -INDOCRYPT 2008, 9th International Conference on Cryptology in India, Kharagpur, India, December 14-17, 2008. Proceedings, volume 5365 of Lecture Notes in Computer Science. Springer, 2008.
  9. J. Daemen and V. Rijmen. The Design of Rijndael: AES -The Advanced Encryption Standard. Springer, 2002.
  10. N. Ferguson, J. Kelsey, S. Lucks, B. Schneier, M. Stay, D. Wagner, and D. Whiting. Improved crypt- analysis of Rijndael. In B. Schneier, editor, FSE, volume 1978 of Lecture Notes in Computer Science, pages 213-230. Springer, 2000.
  11. H. Gilbert and M. Minier. A collision attack on 7 rounds of Rijndael. In AES Candidate Conference, pages 230-241, 2000.
  12. M. Gorski and S. Lucks. New related-key boomerang attacks on AES. In Chowdhury et al. [12], pages 266-278.
  13. S. Hirose. Some plausible constructions of double-block-length hash functions. In Robshaw [33], pages 210-225.
  14. P. Junod and S. Vaudenay. FOX : A new family of block ciphers. In H. Handschuh and M. A. Hasan, editors, Selected Areas in Cryptography, volume 3357 of Lecture Notes in Computer Science, pages 114-129. Springer, 2004.
  15. D. Khovratovich, A. Biryukov, and I. Nikolić. Speeding up collision search for byte-oriented hash functions. In M. Fischlin, editor, CT-RSA, volume 5473 of Lecture Notes in Computer Science, pages 164-181. Springer, 2009.
  16. In A. Biryukov, editor, FSE, volume 4593 of Lecture Notes in Computer Science, pages 225-241. Springer, 2007.
  17. L. R. Knudsen and V. Rijmen. Known-key distinguishers for some block ciphers. In K. Kurosawa, editor, ASIACRYPT, volume 4833 of LNCS, pages 315-324. Springer, 2007.
  18. X. Lai and J. L. Massey. Hash function based on block ciphers. In R. A. Rueppel, editor, EUROCRYPT, volume 658 of Lecture Notes in Computer Science, pages 55-70. Springer, 1992.
  19. S. Lee, S. Hong, S. Lee, J. Lim, and S. Yoon. Truncated differential cryptanalysis of Camellia. In K. Kim, editor, ICISC, volume 2288 of Lecture Notes in Computer Science, pages 32-38. Springer, 2001.
  20. J. Lu, O. Dunkelman, N. Keller, and J. Kim. New impossible differential attacks on AES. In Chowdhury et al. [12], pages 279-293.
  21. J. Lu, J. Kim, N. Keller, and O. Dunkelman. Improving the efficiency of impossible differential crypt- analysis of reduced Camellia and MISTY1. In T. Malkin, editor, CT-RSA, volume 4964 of Lecture Notes in Computer Science, pages 370-386. Springer, 2008.
  22. M. Matsui. Linear cryptoanalysis method for DES cipher. In T. Helleseth, editor, EUROCRYPT, volume 765 of Lecture Notes in Computer Science, pages 386-397. Springer, 1993.
  23. M. Matsui. On correlation between the order of S-boxes and the strength of DES. In A. D. Santis, editor, EUROCRYPT, volume 950 of Lecture Notes in Computer Science, pages 366-375. Springer, 1994.
  24. F. Mendel, C. Rechberger, M. Schläffer, and S. S. Thomsen. The rebound attack: Cryptanalysis of re- duced Whirlpool and Grøstl. In O. Dunkelman, editor, FSE, volume 5665 of Lecture Notes in Computer Science, pages 260-276. Springer, 2009.
  25. F. Muller. A new attack against Khazad. In C.-S. Laih, editor, ASIACRYPT, volume 2894 of Lecture Notes in Computer Science, pages 347-358. Springer, 2003.
  26. M. J. B. Robshaw, editor. Fast Software Encryption, 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers, volume 4047 of Lecture Notes in Computer Sci- ence. Springer, 2006.
  27. M. Schläffer and E. Oswald. Searching for differential paths in MD4. In Robshaw [33], pages 242-261.

Cited by

Sorted by citations

Authors
Biryukov, A., & Nikolić, I.
Affiliations
University of Luxembourg (LU)
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2010
Volume
2010
Pages
322-344
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-642-13190-5_17
OpenAlex
W2095934050
Cited by
110
References
2
Citations by year
2024: 8 · 2023: 2 · 2022: 7 · 2021: 8 · 2020: 5 · 2019: 8 · 2018: 5 · 2017: 14 · 2016: 9 · 2015: 10 · 2014: 7 · 2013: 7 · 2012: 7
FWCI
6.87
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • Open Repository and Bibliography (University of Luxembourg) (submittedVersion, cc-by-nc-sa)
  • IACR Cryptology ePrint Archive (submittedVersion)
Funders
Fonds National de la Recherche Luxembourg
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
Keywords
related-key attacks, differential cryptanalysis, block cipher, AES, Camellia, foxes, Anubis, provable security, hash functions

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