{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JNAAMYTHQ6SYQEKTJRZFIMMNRR","short_pith_number":"pith:JNAAMYTH","schema_version":"1.0","canonical_sha256":"4b4006626787a58811534c7254318d8c67de983181eaf4553bc7c24344ec6901","source":{"kind":"arxiv","id":"2402.11269","version":1},"attestation_state":"computed","paper":{"title":"A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Minki Hhan","submitted_at":"2024-02-17T13:00:47Z","abstract_excerpt":"This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models.\n  - In the classical generic group model (GGM), we find simple alternative proofs for the lower bounds of variants of the discrete logarithm (DL) problem: the multiple-instance DL and one-more DL problems (and their mixture). We also re-prove the unknown-order GGM lower bounds, such as the order finding, root extraction, and repeated squaring.\n  - In the quantum generic group model (QGGM), we study the complexity of variants of the discrete logarit"},"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":"2402.11269","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-17T13:00:47Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"0281292a7959605ed69c1ca9c0bc85f2386bea558f82cecedd31e4d1c7070029","abstract_canon_sha256":"ee10988e2d7a21b463cb291fd94e392591d7fad3d566dc2b4b5f7a028925ef23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:36.591826Z","signature_b64":"6Rq36d/iXHBbOIXaYirulp4v0zmVxigCW/qx9wM2hNTQ2eq6mMdRs+ekOlMrCgBcal9yERe6HPWbcHIoJ7fyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b4006626787a58811534c7254318d8c67de983181eaf4553bc7c24344ec6901","last_reissued_at":"2026-07-05T07:46:36.591418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:36.591418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Minki Hhan","submitted_at":"2024-02-17T13:00:47Z","abstract_excerpt":"This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models.\n  - In the classical generic group model (GGM), we find simple alternative proofs for the lower bounds of variants of the discrete logarithm (DL) problem: the multiple-instance DL and one-more DL problems (and their mixture). We also re-prove the unknown-order GGM lower bounds, such as the order finding, root extraction, and repeated squaring.\n  - In the quantum generic group model (QGGM), we study the complexity of variants of the discrete logarit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11269","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.11269/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":"2402.11269","created_at":"2026-07-05T07:46:36.591474+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11269v1","created_at":"2026-07-05T07:46:36.591474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11269","created_at":"2026-07-05T07:46:36.591474+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNAAMYTHQ6SY","created_at":"2026-07-05T07:46:36.591474+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNAAMYTHQ6SYQEKT","created_at":"2026-07-05T07:46:36.591474+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNAAMYTH","created_at":"2026-07-05T07:46:36.591474+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/JNAAMYTHQ6SYQEKTJRZFIMMNRR","json":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR.json","graph_json":"https://pith.science/api/pith-number/JNAAMYTHQ6SYQEKTJRZFIMMNRR/graph.json","events_json":"https://pith.science/api/pith-number/JNAAMYTHQ6SYQEKTJRZFIMMNRR/events.json","paper":"https://pith.science/paper/JNAAMYTH"},"agent_actions":{"view_html":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR","download_json":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR.json","view_paper":"https://pith.science/paper/JNAAMYTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11269&json=true","fetch_graph":"https://pith.science/api/pith-number/JNAAMYTHQ6SYQEKTJRZFIMMNRR/graph.json","fetch_events":"https://pith.science/api/pith-number/JNAAMYTHQ6SYQEKTJRZFIMMNRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR/action/storage_attestation","attest_author":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR/action/author_attestation","sign_citation":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR/action/citation_signature","submit_replication":"https://pith.science/pith/JNAAMYTHQ6SYQEKTJRZFIMMNRR/action/replication_record"}},"created_at":"2026-07-05T07:46:36.591474+00:00","updated_at":"2026-07-05T07:46:36.591474+00:00"}