Playfair crib validation as a constraint satisfaction problem

Abstract

This paper shows how a crib1 for a Playfair enciphered message can be seen as a constraint satisfaction problem. This problem can then be solved with standard constraint programming tools. The solution will tell whether the crib is possible, and if so, can list all possible Playfair keys that would result in the given crib.