{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZBVDURQFVDNXZCMOCNKFH7KEMO","short_pith_number":"pith:ZBVDURQF","schema_version":"1.0","canonical_sha256":"c86a3a4605a8db7c898e135453fd4463b3d5f1db18987d2eaa7ee60b5c018a66","source":{"kind":"arxiv","id":"1503.04238","version":1},"attestation_state":"computed","paper":{"title":"A Knapsack-Like Code Using Recurrence Sequence Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Bala Krishnamoorthy, Nathan Hamlin, William Webb","submitted_at":"2015-03-13T22:35:23Z","abstract_excerpt":"We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build a knapsack-like public key cryptosystem. We also present new disguising methods, and provide arguments for the security of the code against known methods of attack."},"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":"1503.04238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-03-13T22:35:23Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"78fa5c5ac0e8c8fded35099a9cad5c1ded98d870fbdaa2e05fe1d063e463545b","abstract_canon_sha256":"74b57024a9403dd2ac8bcbaf577d4a0be014653c1a442f763a957a1beefcd009"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:25.721571Z","signature_b64":"7IJorZBxl3zWj24e+oUxXZGIavZOWppBf+kq0JntKyR8+njuL1j7lDX5fKUrN/eyOyR7H3J1U+yvRGCgHsiPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c86a3a4605a8db7c898e135453fd4463b3d5f1db18987d2eaa7ee60b5c018a66","last_reissued_at":"2026-05-18T02:23:25.720935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:25.720935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Knapsack-Like Code Using Recurrence Sequence Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Bala Krishnamoorthy, Nathan Hamlin, William Webb","submitted_at":"2015-03-13T22:35:23Z","abstract_excerpt":"We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build a knapsack-like public key cryptosystem. We also present new disguising methods, and provide arguments for the security of the code against known methods of attack."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04238","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":"1503.04238","created_at":"2026-05-18T02:23:25.721041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04238v1","created_at":"2026-05-18T02:23:25.721041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04238","created_at":"2026-05-18T02:23:25.721041+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBVDURQFVDNX","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBVDURQFVDNXZCMO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBVDURQF","created_at":"2026-05-18T12:29:52.810259+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/ZBVDURQFVDNXZCMOCNKFH7KEMO","json":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO.json","graph_json":"https://pith.science/api/pith-number/ZBVDURQFVDNXZCMOCNKFH7KEMO/graph.json","events_json":"https://pith.science/api/pith-number/ZBVDURQFVDNXZCMOCNKFH7KEMO/events.json","paper":"https://pith.science/paper/ZBVDURQF"},"agent_actions":{"view_html":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO","download_json":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO.json","view_paper":"https://pith.science/paper/ZBVDURQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04238&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBVDURQFVDNXZCMOCNKFH7KEMO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBVDURQFVDNXZCMOCNKFH7KEMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO/action/storage_attestation","attest_author":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO/action/author_attestation","sign_citation":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO/action/citation_signature","submit_replication":"https://pith.science/pith/ZBVDURQFVDNXZCMOCNKFH7KEMO/action/replication_record"}},"created_at":"2026-05-18T02:23:25.721041+00:00","updated_at":"2026-05-18T02:23:25.721041+00:00"}