Can Sequence-to-Sequence Models Crack Substitution Ciphers?
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.
Code (0)
등록된 구현이 없습니다.
Tasks
DeciphermentLanguage IdentificationLanguage ModelingLanguage ModellingSimilar Papers 제목 키워드 기반
Segmenting Numerical Substitution Ciphers
Deciphering historical substitution ciphers is a challenging problem. Example problems that have been previously studied include detecting cipher type, detecting plaintext language, and acquiring the substitution key for…
Language ModelingLanguage ModellingSegmentationLearning to Decipher Hate Symbols
Existing computational models to understand hate speech typically frame the problem as a simple classification task, bypassing the understanding of hate symbols (e.g., 14 words, kigy) and their secret connotations. In th…
General Classification