{"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":"/task/cryptanalysis","name":"Cryptanalysis","slug":"cryptanalysis","description_markdown":null,"categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":37,"papers_with_code":8,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":37,"of":37,"of_with_code":8,"tagged_in_all":37,"counts":{"archive_papers_tagged":37,"with_a_code_link":8,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":37,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/polynomial-time-cryptanalytic-extraction-of-1","slug":"polynomial-time-cryptanalytic-extraction-of-1","title":"Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Setting","date":"2024-10-08","arxiv_id":"2410.05750","repositories_listed":1,"syntology":null},{"url":"/paper/learning-quantum-processes-with-quantum","slug":"learning-quantum-processes-with-quantum","title":"Learning Quantum Processes with Quantum Statistical Queries","date":"2023-10-03","arxiv_id":"2310.02075","repositories_listed":1,"syntology":null},{"url":"/paper/memorization-for-good-encryption-with","slug":"memorization-for-good-encryption-with","title":"Memorization for Good: Encryption with Autoregressive Language Models","date":"2023-05-15","arxiv_id":"2305.10445","repositories_listed":1,"syntology":null},{"url":"/paper/improved-neural-distinguishers-with-related","slug":"improved-neural-distinguishers-with-related","title":"Improved (Related-key) Differential-based Neural Distinguishers for SIMON and SIMECK Block Ciphers","date":"2022-01-11","arxiv_id":"2201.03767","repositories_listed":1,"syntology":null},{"url":"/paper/improving-attacks-on-round-reduced-speck32-64","slug":"improving-attacks-on-round-reduced-speck32-64","title":"Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-cryptanalysis-of-a-quantum","slug":"machine-learning-cryptanalysis-of-a-quantum","title":"Machine Learning Cryptanalysis of a Quantum Random Number Generator","date":"2019-05-07","arxiv_id":"1905.02342","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-enigma-with-recurrent-neural","slug":"learning-the-enigma-with-recurrent-neural","title":"Learning the Enigma with Recurrent Neural Networks","date":"2017-08-24","arxiv_id":"1708.07576","repositories_listed":1,"syntology":null},{"url":"/paper/encoding-cryptographic-functions-to-sat-using","slug":"encoding-cryptographic-functions-to-sat-using","title":"Encoding Cryptographic Functions to SAT Using Transalg System","date":"2016-07-04","arxiv_id":"1607.00888","repositories_listed":1,"syntology":null},{"url":null,"slug":"navigating-the-deep-signature-extraction-on","title":"Navigating the Deep: Signature Extraction on Deep Neural Networks","date":"2025-06-20","arxiv_id":"2506.17047","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-large-language-models-for-7","title":"Benchmarking Large Language Models for Cryptanalysis and Mismatched-Generalization","date":"2025-05-30","arxiv_id":"2505.24621","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-inspired-advances-in-integral","title":"Neural-Inspired Advances in Integral Cryptanalysis","date":"2025-05-16","arxiv_id":"2505.10790","repositories_listed":0,"syntology":null},{"url":null,"slug":"cryptanalysis-via-machine-learning-based","title":"Cryptanalysis via Machine Learning Based Information Theoretic Metrics","date":"2025-01-25","arxiv_id":"2501.15076","repositories_listed":0,"syntology":null},{"url":null,"slug":"cryptanalysis-of-cancelable-biometrics-vault","title":"Cryptanalysis of Cancelable Biometrics Vault","date":"2025-01-10","arxiv_id":"2501.05786","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-analysis-and-comparison-of","title":"Structured Analysis and Comparison of Alphabets in Historical Handwritten Ciphers","date":"2024-10-29","arxiv_id":"2410.21913","repositories_listed":0,"syntology":null},{"url":null,"slug":"teaching-transformers-modular-arithmetic-at","title":"Teaching Transformers Modular Arithmetic at Scale","date":"2024-10-04","arxiv_id":"2410.03569","repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-indistinguishability-with-transfer","title":"A Machine Learning-Based Framework for Assessing Cryptographic Indistinguishability of Lightweight Block Ciphers","date":"2024-05-30","arxiv_id":"2405.19683","repositories_listed":0,"syntology":null},{"url":null,"slug":"cryptanalysis-of-the-simon-cypher-using-neo4j","title":"Cryptanalysis of the SIMON Cypher Using Neo4j","date":"2024-05-08","arxiv_id":"2405.04735","repositories_listed":0,"syntology":null},{"url":null,"slug":"cryptanalysis-and-improvement-of-multimodal","title":"Cryptanalysis and improvement of multimodal data encryption by machine-learning-based system","date":"2024-02-24","arxiv_id":"2402.15779","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-a-tabula-recta-provide-security-in-the","title":"Can a Tabula Recta provide security in the XXI century?","date":"2023-12-05","arxiv_id":"2312.02869","repositories_listed":0,"syntology":null},{"url":null,"slug":"crypto-mine-cryptanalysis-via-mutual","title":"CRYPTO-MINE: Cryptanalysis via Mutual Information Neural Estimation","date":"2023-09-14","arxiv_id":"2309.08019","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-differential-neural-cryptanalysis","title":"Improved Differential-neural Cryptanalysis for Round-reduced Simeck32/64","date":"2023-01-27","arxiv_id":"2301.11601","repositories_listed":0,"syntology":null},{"url":null,"slug":"unclonability-and-quantum-cryptanalysis-from","title":"Unclonability and Quantum Cryptanalysis: From Foundations to Applications","date":"2022-10-31","arxiv_id":"2210.17545","repositories_listed":0,"syntology":null},{"url":null,"slug":"salsa-attacking-lattice-cryptography-with","title":"SALSA: Attacking Lattice Cryptography with Transformers","date":"2022-07-11","arxiv_id":"2207.04785","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-cleartext-in-historical-ciphers","title":"Identifying Cleartext in Historical Ciphers","date":"2022-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-aes-keys-with-a-deep-cold-boot","title":"Recovering AES Keys with a Deep Cold Boot Attack","date":"2021-06-09","arxiv_id":"2106.04876","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-normal-form-characterization-for-efficient","title":"A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis","date":"2021-04-29","arxiv_id":"2104.14098","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-quantum-cloning-improving","title":"Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis","date":"2020-12-21","arxiv_id":"2012.11424","repositories_listed":0,"syntology":null},{"url":null,"slug":"shallow-encoder-deep-decoder-sedd-networks","title":"Shallow Encoder Deep Decoder (SEDD) Networks for Image Encryption and Decryption","date":"2020-01-09","arxiv_id":"2001.03017","repositories_listed":0,"syntology":null},{"url":null,"slug":"rand-ofdm-a-secured-wireless-signal","title":"Rand-OFDM: A Secured Wireless Signal","date":"2019-12-11","arxiv_id":"1912.05615","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-cryptanalysis-of-two-cancelable-biometric","title":"A Cryptanalysis of Two Cancelable Biometric Schemes based on Index-of-Max Hashing","date":"2019-10-03","arxiv_id":"1910.01389","repositories_listed":0,"syntology":null},{"url":null,"slug":"known-plaintext-attack-and-ciphertext-only","title":"Known-plaintext attack and ciphertext-only attack for encrypted single-pixel imaging","date":"2019-05-31","arxiv_id":"1905.13594","repositories_listed":0,"syntology":null},{"url":null,"slug":"translation-of-algorithmic-descriptions-of","title":"Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems","date":"2018-05-17","arxiv_id":"1805.07239","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-cryptographic-attacks-using-backdoors-for","title":"On Cryptographic Attacks Using Backdoors for SAT","date":"2018-03-13","arxiv_id":"1803.04646","repositories_listed":0,"syntology":null},{"url":null,"slug":"contravening-esotery-cryptanalysis-of","title":"Contravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic Algorithms","date":"2016-06-20","arxiv_id":"1606.06047","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-critical-reassessment-of-evolutionary","title":"A Critical Reassessment of Evolutionary Algorithms on the cryptanalysis of the simplified data encryption standard algorithm","date":"2014-07-08","arxiv_id":"1407.1993","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-systems-for-information-security","title":"Intelligent Systems for Information Security","date":"2014-01-15","arxiv_id":"1401.3592","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-estimating-total-time-to-solve-sat-in","title":"On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project","date":"2013-08-04","arxiv_id":"1308.0761","repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"5317d33986ccc3c8a2d8a8adec3d3c188d8dcd8a51788e8e98ed784e45ba2788","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}