{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KUBZA5JVCI5YAFFDKW2GI5UO4G","short_pith_number":"pith:KUBZA5JV","schema_version":"1.0","canonical_sha256":"5503907535123b8014a355b464768ee1971afcf60ec4504e2353b9b3c4bdc4dc","source":{"kind":"arxiv","id":"1607.00888","version":1},"attestation_state":"computed","paper":{"title":"Encoding Cryptographic Functions to SAT Using Transalg System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.AI","authors_text":"Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov","submitted_at":"2016-07-04T13:57:35Z","abstract_excerpt":"In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers. We implemented this technology in the form of the software system called Transalg, and used it to construct SAT encodings for a number of cryptanalysis problems. By applying SAT solvers to these encodings we managed to invert several cryptographic functions. In particular, we used the SAT encodings produced by Transalg to construct the family of two-block MD5 collisions in which the first 10"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.00888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-04T13:57:35Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"9f0674e3a5d6c4e442b0bab3247ce7c3ac4839b1044bee2ef291ec7c721dc602","abstract_canon_sha256":"26767f39d5fc0f55fae029cd71e7b043cb0a6a0b02bc6a05d5343e3b3db5a598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.075388Z","signature_b64":"0jbq2/l4IpmNG4lZ90wc8BwpmAKhLKXBNZWarlcwwbVLrlArGvYi0iciOCOpOMOrnoFhAzVX2gHWkcCgvG80DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5503907535123b8014a355b464768ee1971afcf60ec4504e2353b9b3c4bdc4dc","last_reissued_at":"2026-05-18T01:11:34.074995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.074995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding Cryptographic Functions to SAT Using Transalg System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.AI","authors_text":"Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov","submitted_at":"2016-07-04T13:57:35Z","abstract_excerpt":"In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers. We implemented this technology in the form of the software system called Transalg, and used it to construct SAT encodings for a number of cryptanalysis problems. By applying SAT solvers to these encodings we managed to invert several cryptographic functions. In particular, we used the SAT encodings produced by Transalg to construct the family of two-block MD5 collisions in which the first 10"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00888","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00888","created_at":"2026-05-18T01:11:34.075054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00888v1","created_at":"2026-05-18T01:11:34.075054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00888","created_at":"2026-05-18T01:11:34.075054+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUBZA5JVCI5Y","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUBZA5JVCI5YAFFD","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUBZA5JV","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.07501","citing_title":"A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G","json":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G.json","graph_json":"https://pith.science/api/pith-number/KUBZA5JVCI5YAFFDKW2GI5UO4G/graph.json","events_json":"https://pith.science/api/pith-number/KUBZA5JVCI5YAFFDKW2GI5UO4G/events.json","paper":"https://pith.science/paper/KUBZA5JV"},"agent_actions":{"view_html":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G","download_json":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G.json","view_paper":"https://pith.science/paper/KUBZA5JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00888&json=true","fetch_graph":"https://pith.science/api/pith-number/KUBZA5JVCI5YAFFDKW2GI5UO4G/graph.json","fetch_events":"https://pith.science/api/pith-number/KUBZA5JVCI5YAFFDKW2GI5UO4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G/action/storage_attestation","attest_author":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G/action/author_attestation","sign_citation":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G/action/citation_signature","submit_replication":"https://pith.science/pith/KUBZA5JVCI5YAFFDKW2GI5UO4G/action/replication_record"}},"created_at":"2026-05-18T01:11:34.075054+00:00","updated_at":"2026-05-18T01:11:34.075054+00:00"}