Direct comparison of the execution times with the previous work is difficult because of variable computing configurations, as well as the unavailability of the implementations.
on ciphers of the length of 128, our MCTS version takes on average 197 seconds, which is comparable to 152 seconds reported by , and faster than our reimplementation of the bigram solver of Ravi and Knight (2008) which takes on average 563 seconds.