Time/memory/data trade-off attack to a psuedo-random generator

TL;DR

This paper analyzes the vulnerabilities of the GMGK pseudo-random generator against time/memory/data trade-off attacks, demonstrating that it is less secure than previously claimed through structural attacks that recover plaintext blocks more efficiently.

Contribution

It provides a detailed analysis of the GMGK generator's weaknesses and introduces three structural attack variants that outperform brute-force methods.

Findings

GMGK generator is vulnerable to TMDTO attacks

Proposed attacks can recover plaintext blocks with lower complexity

GMGK does not meet its claimed security level

Abstract

Time, data and memory trade off attack is one of the most important threats against pseudo- random generators and resisting against it, is considered as a main criteria of designing such generators. In this research, the pseudo-random GMGK generator will be addressed and analyzed in details. Having indicated various weaknesses of this generator, we performed three different versions of structural attack on this generator and showed that proposed TMDTO attacks to this generator can discover blocks of plaintext with lower complexity than exhaustive search of space of key generator. Results indicated that the mentioned generator is lack of the security claimed by authors.