Proceedings of the 8th International Conference on Historical Cryptology (HistoCrypt 2025)

Permanent URI for this collectionhttps://hdl.handle.net/10062/109727

Browse

Browsing Proceedings of the 8th International Conference on Historical Cryptology (HistoCrypt 2025) by Author "Bean, Richard"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    listelement.badge.dso-type Item , listelement.badge.access-status Open Access ,
    New records for Playfair solutions
    (Tartu University Library, 2025) Bean, Richard; Helm, Louie; Antal, Eugen; Marák, Pavol
    We give solutions to the 24 letter and 22 letter Playfair challenges proposed in Dunin et al. (2022) A number of methods were tried combining successful approaches of previous solvers, introducing new ideas while using letter-level and word-level approaches. We used vanilla and positional n-gram models for n values from 6 up to 10. However, these did not greatly assist to distinguish the intended solution from other high-scoring solutions. The most effective discriminative approach involved using a multi-terabyte-scale, unpruned large language model from Buck, Heafield, and Van Ooyen (2014) which moved the solution in each case into the top 5,000 ranked possibilities.