Playfair crib validation as a constraint satisfaction problem

Lühendatud kirje lehekülg
dc.contributor.authorEkhall, Magnus
dc.contributor.editorAntal, Eugen
dc.contributor.editorMarák, Pavol
dc.date.accessioned2025-05-16T13:02:09Z
dc.date.available2025-05-16T13:02:09Z
dc.date.issued2025
dc.description.abstractThis 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.
dc.identifier.issn1736-6305
dc.identifier.urihttps://hdl.handle.net/10062/109744
dc.language.isoen
dc.publisherTartu University Library
dc.relation.ispartofseriesNEALT Proceedings Series 58
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectPlayfair cipher
dc.subjectConstraint programming
dc.subjectConstraint satisfaction problem
dc.titlePlayfair crib validation as a constraint satisfaction problem
dc.typeArticle

Failid

Originaal pakett

Nüüd näidatakse 1 - 1 1
Pisipilt
Nimi:
6.pdf
Suurus:
240.42 KB
Formaat:
Adobe Portable Document Format
Lae alla

Kollektsioonid

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