{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-the-enigma-with-recurrent-neural","title":"Learning the Enigma with Recurrent Neural Networks","arxiv_id":"1708.07576","date":"2017-08-24","proceeding":null,"authors":["Sam Greydanus"],"abstract":"Recurrent neural networks (RNNs) represent the state of the art in\ntranslation, image captioning, and speech recognition. They are also capable of\nlearning algorithmic tasks such as long addition, copying, and sorting from a\nset of training examples. We demonstrate that RNNs can learn decryption\nalgorithms -- the mappings from plaintext to ciphertext -- for three\npolyalphabetic ciphers (Vigen\\`ere, Autokey, and Enigma). Most notably, we\ndemonstrate that an RNN with a 3000-unit Long Short-Term Memory (LSTM) cell can\nlearn the decryption function of the Enigma machine. We argue that our model\nlearns efficient internal representations of these ciphers 1) by exploring\nactivations of individual memory neurons and 2) by comparing memory usage\nacross the three ciphers. To be clear, our work is not aimed at 'cracking' the\nEnigma cipher. However, we do show that our model can perform elementary\ncryptanalysis by running known-plaintext attacks on the Vigen\\`ere and Autokey\nciphers. Our results indicate that RNNs can learn algorithmic representations\nof black box polyalphabetic ciphers and that these representations are useful\nfor cryptanalysis.","url_abs":"http://arxiv.org/abs/1708.07576v2","url_pdf":"http://arxiv.org/pdf/1708.07576v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-the-enigma-with-recurrent-neural","repo_url":"https://github.com/greydanus/crypto-rnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"cryptanalysis","task_name":"Cryptanalysis"},{"task_slug":"translation","task_name":"Translation"},{"task_slug":"speech-recognition-1","task_name":"speech-recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.07576","atlas_url":"https://app.syntology.ai/?focus=1708.07576","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1708.07576"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.07576\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.07576"},"call":"get_concepts_for_paper(arxiv_id=\"1708.07576\")"}],"by_repo":[{"repo":"greydanus/crypto-rnn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"92c196d00b43aa6fe53679c7f76f311f33ea5cdd99cd4e4b438c9f5dc3b59312","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}