{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JU22JDSEFLBBIYGDLWJR5PA6AB","short_pith_number":"pith:JU22JDSE","schema_version":"1.0","canonical_sha256":"4d35a48e442ac21460c35d931ebc1e005b0ac9f56fac9b44ac310a1fa7d7b6c2","source":{"kind":"arxiv","id":"2101.11404","version":3},"attestation_state":"computed","paper":{"title":"An Open-source Library of Large Integer Polynomial Multipliers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Malik Imran, Samuel Pagliarini, Zain Ul Abideen","submitted_at":"2021-01-27T13:57:09Z","abstract_excerpt":"Polynomial multiplication is a bottleneck in most of the public-key cryptography protocols, including Elliptic-curve cryptography and several of the post-quantum cryptography algorithms presently being studied. In this paper, we present a library of various large integer polynomial multipliers to be used in hardware cryptocores. Our library contains both digitized and non-digitized multiplier flavours for circuit designers to choose from. The library is supported by a C++ generator that automatically produces the multipliers' logic in Verilog HDL that is amenable for FPGA and ASIC designs. Mor"},"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":"2101.11404","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-01-27T13:57:09Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"e887c1f3a3eae2516b27d383ddf6eef21e79bbd0f42b72d2cf66fea8de740e7b","abstract_canon_sha256":"1f5a6df47e169fc988965c1e2774d49a191b01741103e8afb7804adfc9fcf452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:55.140989Z","signature_b64":"/sxyY1xvB1eQS3nXdh0kFmZ1mojvlI73LEYLzcJ193voFPk/4akM33nTLnVHfHFSfWsF394HELQWABtcVb1ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d35a48e442ac21460c35d931ebc1e005b0ac9f56fac9b44ac310a1fa7d7b6c2","last_reissued_at":"2026-07-05T02:26:55.140498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:55.140498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Open-source Library of Large Integer Polynomial Multipliers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Malik Imran, Samuel Pagliarini, Zain Ul Abideen","submitted_at":"2021-01-27T13:57:09Z","abstract_excerpt":"Polynomial multiplication is a bottleneck in most of the public-key cryptography protocols, including Elliptic-curve cryptography and several of the post-quantum cryptography algorithms presently being studied. In this paper, we present a library of various large integer polynomial multipliers to be used in hardware cryptocores. Our library contains both digitized and non-digitized multiplier flavours for circuit designers to choose from. The library is supported by a C++ generator that automatically produces the multipliers' logic in Verilog HDL that is amenable for FPGA and ASIC designs. Mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11404","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.11404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.11404","created_at":"2026-07-05T02:26:55.140556+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.11404v3","created_at":"2026-07-05T02:26:55.140556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11404","created_at":"2026-07-05T02:26:55.140556+00:00"},{"alias_kind":"pith_short_12","alias_value":"JU22JDSEFLBB","created_at":"2026-07-05T02:26:55.140556+00:00"},{"alias_kind":"pith_short_16","alias_value":"JU22JDSEFLBBIYGD","created_at":"2026-07-05T02:26:55.140556+00:00"},{"alias_kind":"pith_short_8","alias_value":"JU22JDSE","created_at":"2026-07-05T02:26:55.140556+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/JU22JDSEFLBBIYGDLWJR5PA6AB","json":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB.json","graph_json":"https://pith.science/api/pith-number/JU22JDSEFLBBIYGDLWJR5PA6AB/graph.json","events_json":"https://pith.science/api/pith-number/JU22JDSEFLBBIYGDLWJR5PA6AB/events.json","paper":"https://pith.science/paper/JU22JDSE"},"agent_actions":{"view_html":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB","download_json":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB.json","view_paper":"https://pith.science/paper/JU22JDSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.11404&json=true","fetch_graph":"https://pith.science/api/pith-number/JU22JDSEFLBBIYGDLWJR5PA6AB/graph.json","fetch_events":"https://pith.science/api/pith-number/JU22JDSEFLBBIYGDLWJR5PA6AB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB/action/storage_attestation","attest_author":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB/action/author_attestation","sign_citation":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB/action/citation_signature","submit_replication":"https://pith.science/pith/JU22JDSEFLBBIYGDLWJR5PA6AB/action/replication_record"}},"created_at":"2026-07-05T02:26:55.140556+00:00","updated_at":"2026-07-05T02:26:55.140556+00:00"}