{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZFDM4WSTCO3HMKECXVZSQ7X63B","short_pith_number":"pith:ZFDM4WST","schema_version":"1.0","canonical_sha256":"c946ce5a5313b6762882bd73287efed8735bca241332611a54a821ff7372b751","source":{"kind":"arxiv","id":"1806.00432","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.00432","created_at":"2026-05-18T00:01:09.285698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00432v2","created_at":"2026-05-18T00:01:09.285698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00432","created_at":"2026-05-18T00:01:09.285698+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFDM4WSTCO3H","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFDM4WSTCO3HMKEC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFDM4WST","created_at":"2026-05-18T12:33:07.085635+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/ZFDM4WSTCO3HMKECXVZSQ7X63B","json":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B.json","graph_json":"https://pith.science/api/pith-number/ZFDM4WSTCO3HMKECXVZSQ7X63B/graph.json","events_json":"https://pith.science/api/pith-number/ZFDM4WSTCO3HMKECXVZSQ7X63B/events.json","paper":"https://pith.science/paper/ZFDM4WST"},"agent_actions":{"view_html":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B","download_json":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B.json","view_paper":"https://pith.science/paper/ZFDM4WST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00432&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFDM4WSTCO3HMKECXVZSQ7X63B/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFDM4WSTCO3HMKECXVZSQ7X63B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/action/storage_attestation","attest_author":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/action/author_attestation","sign_citation":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/action/citation_signature","submit_replication":"https://pith.science/pith/ZFDM4WSTCO3HMKECXVZSQ7X63B/action/replication_record"}},"created_at":"2026-05-18T00:01:09.285698+00:00","updated_at":"2026-05-18T00:01:09.285698+00:00"}