100 Men on Death Row Two-Tone Coffee Mug

"100 men are on death row. Their names are placed in 100 boxes on a table, one name to a box. The prisoners are led one at a time into the room with the boxes. Each is allowed to look into 50 boxes to try to find his own name. If every prisoner is able to find his name, all the prisoners are released. Otherwise, all are executed. The prisoners are not allowed to alter the state of the room or boxes in any way, nor communicate after they enter the room; however, they may decide on a strategy in advance. What is their best strategy? Hint: Lbh pna trg nobir guvegl creprag. Ab, ernyyl." I've included the hint because the solution seems incredible... and proving the probability limit is rather tough mathematically. However, figuring out the right strategy is possible without any advanced math, and the result is quite satisfying.