Cryptanalysis of TS-Hash

This note presents attacks on the lightweight hash function TS-Hash proposed by Tsaban, including a polynomial-time preimage attack for short messages (at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> bits), high-probability differentials, a general subexponential-time preimage attack, and linearization techniques.

Authors

Institutions

Publication Details

Journal
IACR Communications in Cryptology
Published
2024-10-07
DOI
https://doi.org/10.62056/akjbhey6b
Primary Topic
Cryptographic Implementations and Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cryptanalysis of TS-Hash

Aleksei Udovenko
IACR Communications in Cryptology
Cryptographic Implementations and Security
article

Cryptanalysis of TS-Hash

Aleksei Udovenko
article en

Abstract

This note presents attacks on the lightweight hash function TS-Hash proposed by Tsaban, including a polynomial-time preimage attack for short messages (at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> bits), high-probability differentials, a general subexponential-time preimage attack, and linearization techniques.

IACR Communications in Cryptology
University of Luxembourg (LU)
Deutsche Forschungsgemeinschaft, Fonds National de la Recherche Luxembourg
Openalex Percentile: Top 85%
Cryptographic Implementations and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.