{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LSEHOMISNUK6CKB7KPTUBJVZII","short_pith_number":"pith:LSEHOMIS","schema_version":"1.0","canonical_sha256":"5c887731126d15e1283f53e740a6b94235ec11f30ccc39faee239c9253d0877d","source":{"kind":"arxiv","id":"1802.06870","version":1},"attestation_state":"computed","paper":{"title":"Formal Analysis of Galois Field Arithmetics - Parallel Verification and Reverse Engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SC","authors_text":"Cunxi Yu, Maciej Ciesielski","submitted_at":"2018-02-16T08:44:57Z","abstract_excerpt":"Galois field (GF) arithmetic circuits find numerous applications in communications, signal processing, and security engineering. Formal verification techniques of GF circuits are scarce and limited to circuits with known bit positions of the primary inputs and outputs. They also require knowledge of the irreducible polynomial $P(x)$, which affects final hardware implementation. This paper presents a computer algebra technique that performs verification and reverse engineering of GF($2^m$) multipliers directly from the gate-level implementation. The approach is based on extracting a unique irre"},"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":"1802.06870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-16T08:44:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d4b5ac7c71687642cae7dbc7c96a4301503dd1bba570a4446c1bdb47ea3f7001","abstract_canon_sha256":"e8ce3115f7cce93d311cf5ba9c2c4a67fe9d46c752f8a1290dfab8b8f5939704"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:54.101095Z","signature_b64":"8lSX5W0khxxlRgmOXuv89s2XqI6DLP2MsTTrcgzAqSU9+CBGOEOSjglMxMnmF/DC1HZl2Es5oGk35py8+3VHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c887731126d15e1283f53e740a6b94235ec11f30ccc39faee239c9253d0877d","last_reissued_at":"2026-05-18T00:22:54.100541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:54.100541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Analysis of Galois Field Arithmetics - Parallel Verification and Reverse Engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SC","authors_text":"Cunxi Yu, Maciej Ciesielski","submitted_at":"2018-02-16T08:44:57Z","abstract_excerpt":"Galois field (GF) arithmetic circuits find numerous applications in communications, signal processing, and security engineering. Formal verification techniques of GF circuits are scarce and limited to circuits with known bit positions of the primary inputs and outputs. They also require knowledge of the irreducible polynomial $P(x)$, which affects final hardware implementation. This paper presents a computer algebra technique that performs verification and reverse engineering of GF($2^m$) multipliers directly from the gate-level implementation. The approach is based on extracting a unique irre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06870","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":"1802.06870","created_at":"2026-05-18T00:22:54.100638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06870v1","created_at":"2026-05-18T00:22:54.100638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06870","created_at":"2026-05-18T00:22:54.100638+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSEHOMISNUK6","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSEHOMISNUK6CKB7","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSEHOMIS","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII","json":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII.json","graph_json":"https://pith.science/api/pith-number/LSEHOMISNUK6CKB7KPTUBJVZII/graph.json","events_json":"https://pith.science/api/pith-number/LSEHOMISNUK6CKB7KPTUBJVZII/events.json","paper":"https://pith.science/paper/LSEHOMIS"},"agent_actions":{"view_html":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII","download_json":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII.json","view_paper":"https://pith.science/paper/LSEHOMIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06870&json=true","fetch_graph":"https://pith.science/api/pith-number/LSEHOMISNUK6CKB7KPTUBJVZII/graph.json","fetch_events":"https://pith.science/api/pith-number/LSEHOMISNUK6CKB7KPTUBJVZII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII/action/storage_attestation","attest_author":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII/action/author_attestation","sign_citation":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII/action/citation_signature","submit_replication":"https://pith.science/pith/LSEHOMISNUK6CKB7KPTUBJVZII/action/replication_record"}},"created_at":"2026-05-18T00:22:54.100638+00:00","updated_at":"2026-05-18T00:22:54.100638+00:00"}