Revisit Two Memoryless State-Recovery Cryptanalysis Methods on A5/1

ePrint Report: Revisit Two Memoryless State-Recovery Cryptanalysis Methods on A5/1

Yanbin Xu, Yonglin Hao, Mingxing Wang

At ASIACRYPT 2019, Zhang proposed a near collision attack on A5/1 claiming to recover the 64-bit A5/1 state with a time complexity around $2^{32}$ cipher ticks with negligible memory requirements. Soon after its proposal, Zhang's near collision attack was severely challenged by Derbez \etal who claimed that Zhang's attack cannot have a time complexity lower than Golic's memoryless guess-and-determine attack dating back to EUROCRYPT …

64-bit asiacrypt attack cipher collision complexity cryptanalysis eprint report memory near recover recovery report requirements state wang