{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:E2XBIGZSQMN6LTAPBGPGILTDIQ","short_pith_number":"pith:E2XBIGZS","schema_version":"1.0","canonical_sha256":"26ae141b32831be5cc0f099e642e634433e56edff28e784a12e625a853808d1c","source":{"kind":"arxiv","id":"1011.5534","version":2},"attestation_state":"computed","paper":{"title":"GB-hash : Hash Functions Using Groebner Basis","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.CR","authors_text":"Dhananjoy Dey, Indranath Sengupta, Prasanna Raghaw Mishra1","submitted_at":"2010-11-25T00:14:19Z","abstract_excerpt":"In this paper we present an improved version of HF-hash, viz., GB-hash : Hash Functions Using Groebner Basis. In case of HF-hash, the compression function consists of 32 polynomials with 64 variables which were taken from the first 32 polynomials of hidden field equations challenge-1 by forcing last 16 variables as 0. In GB-hash we have designed the compression function in such way that these 32 polynomials with 64 variables form a minimal Groebner basis of the ideal generated by them with respect to graded lexicographical (grlex) ordering as well as with respect to graded reverse lexicographi"},"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":"1011.5534","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T00:14:19Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"1a135842654937cf24c95aed731200c3cfaeb817c1e5c46147ac485a55226b99","abstract_canon_sha256":"bc6c0e092e8bbc45cbf4c3b0fa939915ab0682c7bdb7b18f4647fc7498667487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:29.401905Z","signature_b64":"yUIufbf8uycLXY/u4NdYwSsAnijvlgj/brdSuaT7mG1LK1gCra5sHKKjLb+L+lMoXS8kw7zKAw0CBT/StBhYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26ae141b32831be5cc0f099e642e634433e56edff28e784a12e625a853808d1c","last_reissued_at":"2026-05-18T04:14:29.401420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:29.401420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GB-hash : Hash Functions Using Groebner Basis","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.CR","authors_text":"Dhananjoy Dey, Indranath Sengupta, Prasanna Raghaw Mishra1","submitted_at":"2010-11-25T00:14:19Z","abstract_excerpt":"In this paper we present an improved version of HF-hash, viz., GB-hash : Hash Functions Using Groebner Basis. In case of HF-hash, the compression function consists of 32 polynomials with 64 variables which were taken from the first 32 polynomials of hidden field equations challenge-1 by forcing last 16 variables as 0. In GB-hash we have designed the compression function in such way that these 32 polynomials with 64 variables form a minimal Groebner basis of the ideal generated by them with respect to graded lexicographical (grlex) ordering as well as with respect to graded reverse lexicographi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5534","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":"1011.5534","created_at":"2026-05-18T04:14:29.401486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5534v2","created_at":"2026-05-18T04:14:29.401486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5534","created_at":"2026-05-18T04:14:29.401486+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2XBIGZSQMN6","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2XBIGZSQMN6LTAP","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2XBIGZS","created_at":"2026-05-18T12:26:06.534383+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/E2XBIGZSQMN6LTAPBGPGILTDIQ","json":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ.json","graph_json":"https://pith.science/api/pith-number/E2XBIGZSQMN6LTAPBGPGILTDIQ/graph.json","events_json":"https://pith.science/api/pith-number/E2XBIGZSQMN6LTAPBGPGILTDIQ/events.json","paper":"https://pith.science/paper/E2XBIGZS"},"agent_actions":{"view_html":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ","download_json":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ.json","view_paper":"https://pith.science/paper/E2XBIGZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5534&json=true","fetch_graph":"https://pith.science/api/pith-number/E2XBIGZSQMN6LTAPBGPGILTDIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/E2XBIGZSQMN6LTAPBGPGILTDIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ/action/storage_attestation","attest_author":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ/action/author_attestation","sign_citation":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ/action/citation_signature","submit_replication":"https://pith.science/pith/E2XBIGZSQMN6LTAPBGPGILTDIQ/action/replication_record"}},"created_at":"2026-05-18T04:14:29.401486+00:00","updated_at":"2026-05-18T04:14:29.401486+00:00"}