{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZFDM4WSTCO3HMKECXVZSQ7X63B","short_pith_number":"pith:ZFDM4WST","canonical_record":{"source":{"id":"1806.00432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-01T16:41:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"2794b2272cb594c0f3a9ca60fa33f997c8631e0aa18d246866455d7afdb3ae94","abstract_canon_sha256":"f90804634dc05c664a148292bc9b8667997c4f3ffbb3d89ff336cf2d17992238"},"schema_version":"1.0"},"canonical_sha256":"c946ce5a5313b6762882bd73287efed8735bca241332611a54a821ff7372b751","source":{"kind":"arxiv","id":"1806.00432","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00432","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00432v2","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00432","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDM4WSTCO3H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDM4WSTCO3HMKEC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDM4WST","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZFDM4WSTCO3HMKECXVZSQ7X63B","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-01T16:41:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"2794b2272cb594c0f3a9ca60fa33f997c8631e0aa18d246866455d7afdb3ae94","abstract_canon_sha256":"f90804634dc05c664a148292bc9b8667997c4f3ffbb3d89ff336cf2d17992238"},"schema_version":"1.0"},"canonical_sha256":"c946ce5a5313b6762882bd73287efed8735bca241332611a54a821ff7372b751","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:09.286141Z","signature_b64":"8FG/HNRlFZRhoZC6wtY/n2iHPkMKr15GNpY53w/oi0YF9ox8lmVB0yA3q7lE0RTcIw8sN5mMhU1se5CelpsCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c946ce5a5313b6762882bd73287efed8735bca241332611a54a821ff7372b751","last_reissued_at":"2026-05-18T00:01:09.285620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:09.285620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00432","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Sf3KKxpHKi3GQL45hfbadq9O7OeBW9VqswOWise19r8eIZ1kB/1433WoSvJ195wXd7PBUFYdCzDBQtJXXf+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:47:39.771867Z"},"content_sha256":"3124bfa26293cbff91ea4adcb6efb8ee2db4b0118464ca7bf143ae1435bbed4f","schema_version":"1.0","event_id":"sha256:3124bfa26293cbff91ea4adcb6efb8ee2db4b0118464ca7bf143ae1435bbed4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZFDM4WSTCO3HMKECXVZSQ7X63B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new class of irreducible pentanomials for polynomial based multipliers in binary fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Daniel Panario, Gustavo Banegas, Ricardo Custodio","submitted_at":"2018-06-01T16:41:50Z","abstract_excerpt":"We introduce a new class of irreducible pentanomials over $\\mathbb{F}_2$ of the form $f(x) = x^{2b+c} + x^{b+c} + x^b + x^c + 1$. Let $m=2b+c$ and use $f$ to define the finite field extension of degree $m$. We give the exact number of operations required for computing the reduction modulo $f$. We also provide a multiplier based on Karatsuba algorithm in $\\mathbb{F}_2[x]$ combined with our reduction process. We give the total cost of the multiplier and found that the bit-parallel multiplier defined by this new class of polynomials has improved XOR and AND complexity. Our multiplier has comparab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00432","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdCUKPit/saky+UvIIzsxne25lO0rvELpVRzvo8+9ui+hGOZsninux9jQ+krPJIR9Wr/ijGKCAC3Fne2/urzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:47:39.772217Z"},"content_sha256":"6473c0f33acee057458bad997a26f553b16a9d80979d46ca468934aaf301317a","schema_version":"1.0","event_id":"sha256:6473c0f33acee057458bad997a26f553b16a9d80979d46ca468934aaf301317a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/bundle.json","state_url":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T11:47:39Z","links":{"resolver":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B","bundle":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/bundle.json","state":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZFDM4WSTCO3HMKECXVZSQ7X63B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f90804634dc05c664a148292bc9b8667997c4f3ffbb3d89ff336cf2d17992238","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-01T16:41:50Z","title_canon_sha256":"2794b2272cb594c0f3a9ca60fa33f997c8631e0aa18d246866455d7afdb3ae94"},"schema_version":"1.0","source":{"id":"1806.00432","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00432","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00432v2","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00432","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDM4WSTCO3H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDM4WSTCO3HMKEC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDM4WST","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:6473c0f33acee057458bad997a26f553b16a9d80979d46ca468934aaf301317a","target":"graph","created_at":"2026-05-18T00:01:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce a new class of irreducible pentanomials over $\\mathbb{F}_2$ of the form $f(x) = x^{2b+c} + x^{b+c} + x^b + x^c + 1$. Let $m=2b+c$ and use $f$ to define the finite field extension of degree $m$. We give the exact number of operations required for computing the reduction modulo $f$. We also provide a multiplier based on Karatsuba algorithm in $\\mathbb{F}_2[x]$ combined with our reduction process. We give the total cost of the multiplier and found that the bit-parallel multiplier defined by this new class of polynomials has improved XOR and AND complexity. Our multiplier has comparab","authors_text":"Daniel Panario, Gustavo Banegas, Ricardo Custodio","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-01T16:41:50Z","title":"A new class of irreducible pentanomials for polynomial based multipliers in binary fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00432","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3124bfa26293cbff91ea4adcb6efb8ee2db4b0118464ca7bf143ae1435bbed4f","target":"record","created_at":"2026-05-18T00:01:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f90804634dc05c664a148292bc9b8667997c4f3ffbb3d89ff336cf2d17992238","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-01T16:41:50Z","title_canon_sha256":"2794b2272cb594c0f3a9ca60fa33f997c8631e0aa18d246866455d7afdb3ae94"},"schema_version":"1.0","source":{"id":"1806.00432","kind":"arxiv","version":2}},"canonical_sha256":"c946ce5a5313b6762882bd73287efed8735bca241332611a54a821ff7372b751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c946ce5a5313b6762882bd73287efed8735bca241332611a54a821ff7372b751","first_computed_at":"2026-05-18T00:01:09.285620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:09.285620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8FG/HNRlFZRhoZC6wtY/n2iHPkMKr15GNpY53w/oi0YF9ox8lmVB0yA3q7lE0RTcIw8sN5mMhU1se5CelpsCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:09.286141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00432","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3124bfa26293cbff91ea4adcb6efb8ee2db4b0118464ca7bf143ae1435bbed4f","sha256:6473c0f33acee057458bad997a26f553b16a9d80979d46ca468934aaf301317a"],"state_sha256":"ac0138fcb077da3c8287d798a75d397a87642a7eedd0be2b044042e8671f0f76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOiW9x2HduYIyDEDg9xRxm8Y46O8T3h/KNzTSrrQv36h2OYiERGe+Qkzs7xq3r9+DIzfaNq/6O8veYHogxQ4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:47:39.774020Z","bundle_sha256":"768c21a22398e0911407730d6b4760dd0b46e6485feac3a95d3f8d68d258d975"}}