{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3E76MRUWDCFF4TM2HEJMPP73IN","short_pith_number":"pith:3E76MRUW","schema_version":"1.0","canonical_sha256":"d93fe64696188a5e4d9a3912c7bffb436b5cf33b72c1b4f585b412af15c0f832","source":{"kind":"arxiv","id":"1507.03674","version":1},"attestation_state":"computed","paper":{"title":"Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.CR","authors_text":"Heliang Huang, Wansu Bao","submitted_at":"2015-07-14T00:51:29Z","abstract_excerpt":"Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined MQ-problem is Hiroyuki Miura et al.'s algorithm, which is a polynomial-time algorithm when \\[n \\ge m(m + 3)/2\\] and the characteristic of the field is even. In order to get a wider applicable range, we reduce the underdefined MQ-problem to the problem of finding square roots over finite field, and then combine with the guess and determine method. In this wa"},"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":"1507.03674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-07-14T00:51:29Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"a3bdf764f077bd8a9f4c9af9dd79f98bc7895c122f8d375e09e26729caf5bea2","abstract_canon_sha256":"3dc02ab61bec35e235fd49bfc5ec3e6cbcab9db0a3bb74e44d0157f4a8e90c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.634147Z","signature_b64":"eUwtcAWfI/aPCa/5s2vTp5vV0xYs7BFTDdLYGMMPrizZtxZDyZOWAtel2JzSf74FYaKWvCpM9fNKUoXIrAlEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d93fe64696188a5e4d9a3912c7bffb436b5cf33b72c1b4f585b412af15c0f832","last_reissued_at":"2026-05-18T01:36:57.633433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.633433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.CR","authors_text":"Heliang Huang, Wansu Bao","submitted_at":"2015-07-14T00:51:29Z","abstract_excerpt":"Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined MQ-problem is Hiroyuki Miura et al.'s algorithm, which is a polynomial-time algorithm when \\[n \\ge m(m + 3)/2\\] and the characteristic of the field is even. In order to get a wider applicable range, we reduce the underdefined MQ-problem to the problem of finding square roots over finite field, and then combine with the guess and determine method. In this wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03674","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":"1507.03674","created_at":"2026-05-18T01:36:57.633554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03674v1","created_at":"2026-05-18T01:36:57.633554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03674","created_at":"2026-05-18T01:36:57.633554+00:00"},{"alias_kind":"pith_short_12","alias_value":"3E76MRUWDCFF","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3E76MRUWDCFF4TM2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3E76MRUW","created_at":"2026-05-18T12:29:02.477457+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/3E76MRUWDCFF4TM2HEJMPP73IN","json":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN.json","graph_json":"https://pith.science/api/pith-number/3E76MRUWDCFF4TM2HEJMPP73IN/graph.json","events_json":"https://pith.science/api/pith-number/3E76MRUWDCFF4TM2HEJMPP73IN/events.json","paper":"https://pith.science/paper/3E76MRUW"},"agent_actions":{"view_html":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN","download_json":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN.json","view_paper":"https://pith.science/paper/3E76MRUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03674&json=true","fetch_graph":"https://pith.science/api/pith-number/3E76MRUWDCFF4TM2HEJMPP73IN/graph.json","fetch_events":"https://pith.science/api/pith-number/3E76MRUWDCFF4TM2HEJMPP73IN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN/action/storage_attestation","attest_author":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN/action/author_attestation","sign_citation":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN/action/citation_signature","submit_replication":"https://pith.science/pith/3E76MRUWDCFF4TM2HEJMPP73IN/action/replication_record"}},"created_at":"2026-05-18T01:36:57.633554+00:00","updated_at":"2026-05-18T01:36:57.633554+00:00"}