{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LYCGBQ5ZHVAFZAWAWCZBSLD3JR","short_pith_number":"pith:LYCGBQ5Z","schema_version":"1.0","canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","source":{"kind":"arxiv","id":"1810.00022","version":2},"attestation_state":"computed","paper":{"title":"Hard isogeny problems over RSA moduli and groups with infeasible inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AG"],"primary_cat":"math.NT","authors_text":"Salim Ali Altug, Yilei Chen","submitted_at":"2018-09-28T18:09:21Z","abstract_excerpt":"We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of cryptanalytic attempts on these problems. Moreover, based on the hardness of these problems, we provide a construction of groups with infeasible inversion, where the underlying groups are the ideal class groups of imaginary quadratic orders.\n  Recall that in a group with infeasible inversion, computing the inverse of a group element is required to be hard, whil"},"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":"1810.00022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-28T18:09:21Z","cross_cats_sorted":["cs.CR","math.AG"],"title_canon_sha256":"45669f059c52f7e21633e9531d62b567be3221d444fbcd710a23e831719ccbe6","abstract_canon_sha256":"ec3b3f7939c7bfef2b3f06c9c8f914a7992a9de5101594a4e20d5d16b9a76139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:19.373788Z","signature_b64":"w+S60jW4EYOCTSSJQoSO7XYkkZY7H7xAq+hDhVwMX1pZ0KptdDRQHoCrh8b2C7xBGi7rz6OvU+s3YaCYH+JFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e0460c3b93d405c82c0b0b2192c7b4c6e86b122b0e797772dc0bc803cae4aa4","last_reissued_at":"2026-05-17T23:46:19.372993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:19.372993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hard isogeny problems over RSA moduli and groups with infeasible inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AG"],"primary_cat":"math.NT","authors_text":"Salim Ali Altug, Yilei Chen","submitted_at":"2018-09-28T18:09:21Z","abstract_excerpt":"We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of cryptanalytic attempts on these problems. Moreover, based on the hardness of these problems, we provide a construction of groups with infeasible inversion, where the underlying groups are the ideal class groups of imaginary quadratic orders.\n  Recall that in a group with infeasible inversion, computing the inverse of a group element is required to be hard, whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00022","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":"1810.00022","created_at":"2026-05-17T23:46:19.373135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00022v2","created_at":"2026-05-17T23:46:19.373135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00022","created_at":"2026-05-17T23:46:19.373135+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYCGBQ5ZHVAF","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYCGBQ5ZHVAFZAWA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYCGBQ5Z","created_at":"2026-05-18T12:32:37.024351+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/LYCGBQ5ZHVAFZAWAWCZBSLD3JR","json":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR.json","graph_json":"https://pith.science/api/pith-number/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/graph.json","events_json":"https://pith.science/api/pith-number/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/events.json","paper":"https://pith.science/paper/LYCGBQ5Z"},"agent_actions":{"view_html":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR","download_json":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR.json","view_paper":"https://pith.science/paper/LYCGBQ5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00022&json=true","fetch_graph":"https://pith.science/api/pith-number/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/graph.json","fetch_events":"https://pith.science/api/pith-number/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/action/storage_attestation","attest_author":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/action/author_attestation","sign_citation":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/action/citation_signature","submit_replication":"https://pith.science/pith/LYCGBQ5ZHVAFZAWAWCZBSLD3JR/action/replication_record"}},"created_at":"2026-05-17T23:46:19.373135+00:00","updated_at":"2026-05-17T23:46:19.373135+00:00"}