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

Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1

Aoki, Kazumaro, Sasaki, Yu·2009·Lecture Notes in Computer Science
DOI 10.1007/978-3-642-03356-8_5
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-642-03356-8_5

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

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

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?

  • The new approach originates from the splice-and-cut framework in hash function cryptanalysis, more specifically its element called initial structure.

    “The new approach originates from the so-called spliceand-cut framework [1,2,26] in the hash function cryptanalysis, more specifically its element called initial structure.”

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Aoki, K., & Sasaki, Y.
Affiliations
NTT (Japan) (JP)
ORCID
Sasaki, Yu
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2009
Pages
70-89
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-642-03356-8_5
OpenAlex
W1550036077
Cited by
115
References
1
Citations by year
2026: 4 · 2025: 2 · 2024: 2 · 2023: 4 · 2022: 5 · 2021: 5 · 2020: 2 · 2019: 3 · 2018: 2 · 2017: 3 · 2016: 2 · 2015: 14 · 2014: 13 · 2013: 13 · 2012: 18
FWCI
9.62
Type
conference paper
Language
en
Open access
closed
Licence
www.springer.com/tdm (unspecified)
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
meet-in-the-middle attack, preimage attack, SHA-1, hash function cryptanalysis, compression function, reduced-round attacks

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