Internet security is a major concern, but cryptographic protocol analysis tools often require a long time due to their computational complexity. Professor Kazuhiro Ogata and Assistant Professor Canh Minh Do of the Department of Computing Science at Japan Advanced Institute of Science and Technology (JAIST) have successfully parallelized two key steps—backward narrowing and transition subsumption—in Maude-NPA, resulting in what they call Par-Maude-NPA.