{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D5N6XXSHU5YE4HPLQLL7OV3XAA","short_pith_number":"pith:D5N6XXSH","schema_version":"1.0","canonical_sha256":"1f5bebde47a7704e1deb82d7f7577700358b7b6b03c3ba6d8cb9e53077221189","source":{"kind":"arxiv","id":"1605.04870","version":2},"attestation_state":"computed","paper":{"title":"t-multiple discrete logarithm problem and solving difficulty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Jianhong Shi, Wansu Bao, Xiangqun Fu, Xiang Wang","submitted_at":"2016-03-22T11:50:01Z","abstract_excerpt":"Considering the difficult problem under classical computing model can be solved by the quantum algorithm in polynomial time, t-multiple discrete logarithm problems presented. The problem is non-degeneracy and unique solution. We talk about what the parameter effects the problem solving difficulty. Then we pointed out that the index-calculus algorithm is not suitable for the problem, and two sufficient conditions of resistance to the quantum algorithm for the hidden subgroup problem are given."},"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":"1605.04870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-03-22T11:50:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"68dd00c2dc4714af7433db1c20c600c4b72abf0a85a64da48fb9ed568aac2042","abstract_canon_sha256":"a22d6384be1b89a769c060c8489fb3ab40846a4f39762f0c773cdf1912cb88f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:22.535078Z","signature_b64":"KbG90xogV2ykyAelfcZHiiHVvHJZTizdLuIe8RlyrptRgL0QLwJv6oOMJ7JwAtHSxtWzskK98u5ZsZX/Wq5ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f5bebde47a7704e1deb82d7f7577700358b7b6b03c3ba6d8cb9e53077221189","last_reissued_at":"2026-05-18T00:20:22.534663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:22.534663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"t-multiple discrete logarithm problem and solving difficulty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Jianhong Shi, Wansu Bao, Xiangqun Fu, Xiang Wang","submitted_at":"2016-03-22T11:50:01Z","abstract_excerpt":"Considering the difficult problem under classical computing model can be solved by the quantum algorithm in polynomial time, t-multiple discrete logarithm problems presented. The problem is non-degeneracy and unique solution. We talk about what the parameter effects the problem solving difficulty. Then we pointed out that the index-calculus algorithm is not suitable for the problem, and two sufficient conditions of resistance to the quantum algorithm for the hidden subgroup problem are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04870","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":"1605.04870","created_at":"2026-05-18T00:20:22.534727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04870v2","created_at":"2026-05-18T00:20:22.534727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04870","created_at":"2026-05-18T00:20:22.534727+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5N6XXSHU5YE","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5N6XXSHU5YE4HPL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5N6XXSH","created_at":"2026-05-18T12:30:09.641336+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/D5N6XXSHU5YE4HPLQLL7OV3XAA","json":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA.json","graph_json":"https://pith.science/api/pith-number/D5N6XXSHU5YE4HPLQLL7OV3XAA/graph.json","events_json":"https://pith.science/api/pith-number/D5N6XXSHU5YE4HPLQLL7OV3XAA/events.json","paper":"https://pith.science/paper/D5N6XXSH"},"agent_actions":{"view_html":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA","download_json":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA.json","view_paper":"https://pith.science/paper/D5N6XXSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04870&json=true","fetch_graph":"https://pith.science/api/pith-number/D5N6XXSHU5YE4HPLQLL7OV3XAA/graph.json","fetch_events":"https://pith.science/api/pith-number/D5N6XXSHU5YE4HPLQLL7OV3XAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA/action/storage_attestation","attest_author":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA/action/author_attestation","sign_citation":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA/action/citation_signature","submit_replication":"https://pith.science/pith/D5N6XXSHU5YE4HPLQLL7OV3XAA/action/replication_record"}},"created_at":"2026-05-18T00:20:22.534727+00:00","updated_at":"2026-05-18T00:20:22.534727+00:00"}