Cryptanalysis of MAJE4
Mohammad Ali Orumiehchiha, Elham Shakour · Computational Intelligence and Security · 2007
In this paper, some weak points in design of MAJE4 algorithm are probed and by exploiting them, two cryptographic attacks are proposed for both versions (128-bit, 256-bit). It is proved that MAJE4 is vulnerable against key recovery attack with complexity less than exhaustive search. We show the security of MAJE4-128, -256 are not greater than 296 and 2106 respectively. And also, a distinguish attack is examined that can recognize the output running keys from a truly random stream with data complexity of 278.8 and 284.8 output words for MAJE4-128 and MAJE4-256 respectively.