Can Sequence-to-Sequence Models Crack Substitution Ciphers?

Can Sequence-to-Sequence Models Crack Substitution Ciphers?. Aldarrab, N. & May, J. In Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 7226–7235, Online, August, 2021. Association for Computational Linguistics.

Paper abstract bibtex

Decipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam search and a neural language model to score candidate plaintext hypotheses for a given cipher, assuming the plaintext language is known. We propose an end-to-end multilingual model for solving simple substitution ciphers. We test our model on synthetic and real historical ciphers and show that our proposed method can decipher text without explicit language identification while still being robust to noise.

@inproceedings{aldarrab-may-2021-sequence,
    title = "Can Sequence-to-Sequence Models Crack Substitution Ciphers?",
    author = "Aldarrab, Nada  and
      May, Jonathan",
    booktitle = "Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)",
    month = aug,
    year = "2021",
    address = "Online",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2021.acl-long.561",
    pages = "7226--7235",
    abstract = "Decipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam search and a neural language model to score candidate plaintext hypotheses for a given cipher, assuming the plaintext language is known. We propose an end-to-end multilingual model for solving simple substitution ciphers. We test our model on synthetic and real historical ciphers and show that our proposed method can decipher text without explicit language identification while still being robust to noise.",
}

Downloads: 0

{"_id":"3zfYfY2YRSzP35ty6","bibbaseid":"aldarrab-may-cansequencetosequencemodelscracksubstitutionciphers-2021","author_short":["Aldarrab, N.","May, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Can Sequence-to-Sequence Models Crack Substitution Ciphers?","author":[{"propositions":[],"lastnames":["Aldarrab"],"firstnames":["Nada"],"suffixes":[]},{"propositions":[],"lastnames":["May"],"firstnames":["Jonathan"],"suffixes":[]}],"booktitle":"Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)","month":"August","year":"2021","address":"Online","publisher":"Association for Computational Linguistics","url":"https://aclanthology.org/2021.acl-long.561","pages":"7226–7235","abstract":"Decipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam search and a neural language model to score candidate plaintext hypotheses for a given cipher, assuming the plaintext language is known. We propose an end-to-end multilingual model for solving simple substitution ciphers. We test our model on synthetic and real historical ciphers and show that our proposed method can decipher text without explicit language identification while still being robust to noise.","bibtex":"@inproceedings{aldarrab-may-2021-sequence,\n title = \"Can Sequence-to-Sequence Models Crack Substitution Ciphers?\",\n author = \"Aldarrab, Nada and\n May, Jonathan\",\n booktitle = \"Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)\",\n month = aug,\n year = \"2021\",\n address = \"Online\",\n publisher = \"Association for Computational Linguistics\",\n url = \"https://aclanthology.org/2021.acl-long.561\",\n pages = \"7226--7235\",\n abstract = \"Decipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam search and a neural language model to score candidate plaintext hypotheses for a given cipher, assuming the plaintext language is known. We propose an end-to-end multilingual model for solving simple substitution ciphers. We test our model on synthetic and real historical ciphers and show that our proposed method can decipher text without explicit language identification while still being robust to noise.\",\n}\n\n","author_short":["Aldarrab, N.","May, J."],"key":"aldarrab-may-2021-sequence","id":"aldarrab-may-2021-sequence","bibbaseid":"aldarrab-may-cansequencetosequencemodelscracksubstitutionciphers-2021","role":"author","urls":{"Paper":"https://aclanthology.org/2021.acl-long.561"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://jonmay.github.io/webpage/cutelabname/cutelabname.bib","dataSources":["hbZSwot2msWk92m5B","fcWjcoAgajPvXWcp7","GvHfaAWP6AfN6oLQE","j3Qzx9HAAC6WtJDHS","5eM3sAccSEpjSDHHQ"],"keywords":[],"search_terms":["sequence","sequence","models","crack","substitution","ciphers","aldarrab","may"],"title":"Can Sequence-to-Sequence Models Crack Substitution Ciphers?","year":2021}