A Single-Key Attack on the Full GOST Block Cipher
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Formally introduced in [29], bicliques led to the best preimage attacks on the SHA family of hash functions, including the attack on 50 rounds of SHA-512, and the first attack on a round-reduced Skein hash function.
“Formally introduced in [29], bicliques led to the best preimage attacks on the SHA family of hash functions, including the attack on 50 rounds of SHA-512, and the first attack on a round-reduced Skein hash function.”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [29]
Biclique cryptanalysis was first introduced for hash cryptanalysis.
“Biclique cryptanalysis was first introduced for hash cryptanalysis [29].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [29]
The citation lists haven’t been fetched yet
References 29 · Cited by 90
- Authors
- Isobe, T.
- Affiliations
- Sony (Japan) (JP)
- Corresponding author
- Isobe, Takanori
- ORCID
- Isobe, Takanori
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 290-305
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2206761661
- Cited by
- 90
- References
- 29
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 1 · 2022: 4 · 2021: 5 · 2020: 4 · 2018: 6 · 2017: 5 · 2016: 3 · 2015: 10 · 2014: 8 · 2013: 15 · 2012: 15
- FWCI
- 11.82
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- 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
- key recovery, reflection attacks, meet-in-the-middle attack, known-plaintext attack, block cipher cryptanalysis
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
