{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JEQYXRUUGTEYYTP7J33URZDOGR","short_pith_number":"pith:JEQYXRUU","schema_version":"1.0","canonical_sha256":"49218bc69434c98c4dff4ef748e46e3449b451e19973e260d9add918e3605804","source":{"kind":"arxiv","id":"1601.04134","version":1},"attestation_state":"computed","paper":{"title":"On improvements of the $r$-adding walk in a finite field of characteristic 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ansari Abdullah, Ayan Mahalanobis, Hardik Gajera","submitted_at":"2016-01-16T07:27:08Z","abstract_excerpt":"It is currently known from the work of Shoup and Nechaev that a generic algorithm to solve the discrete logarithm problem in a group of prime order must have complexity at least $k\\sqrt{N}$ where $N$ is the order of the group. In many collision search algorithms this complexity is achieved. So with generic algorithms one can only hope to make the $k$ smaller. This $k$ depends on the complexity of the iterative step in the generic algorithms. The $\\sqrt{N}$ comes from the fact there is about $\\sqrt{N}$ iterations before a collision. So if we can find ways that can reduce the amount of work in o"},"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":"1601.04134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-16T07:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"32ddc788e23eda96eddcf0e29fd1bb54a815cd5b374c5ab0361d205086a007b3","abstract_canon_sha256":"a9b229b165062d48e4913094b0f1b328df4d9569027714852cad1885b238cd85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.804810Z","signature_b64":"0oUgvw3J1ECv1muFzwrmZVrNkAEeAv/j19rHztKMtyKURzUXGEcJXIiagVDWOJq9UfKw0LaSoi3az4J12zLSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49218bc69434c98c4dff4ef748e46e3449b451e19973e260d9add918e3605804","last_reissued_at":"2026-05-18T01:22:45.804293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.804293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On improvements of the $r$-adding walk in a finite field of characteristic 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ansari Abdullah, Ayan Mahalanobis, Hardik Gajera","submitted_at":"2016-01-16T07:27:08Z","abstract_excerpt":"It is currently known from the work of Shoup and Nechaev that a generic algorithm to solve the discrete logarithm problem in a group of prime order must have complexity at least $k\\sqrt{N}$ where $N$ is the order of the group. In many collision search algorithms this complexity is achieved. So with generic algorithms one can only hope to make the $k$ smaller. This $k$ depends on the complexity of the iterative step in the generic algorithms. The $\\sqrt{N}$ comes from the fact there is about $\\sqrt{N}$ iterations before a collision. So if we can find ways that can reduce the amount of work in o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04134","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":"1601.04134","created_at":"2026-05-18T01:22:45.804397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04134v1","created_at":"2026-05-18T01:22:45.804397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04134","created_at":"2026-05-18T01:22:45.804397+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEQYXRUUGTEY","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEQYXRUUGTEYYTP7","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEQYXRUU","created_at":"2026-05-18T12:30:25.849896+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/JEQYXRUUGTEYYTP7J33URZDOGR","json":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR.json","graph_json":"https://pith.science/api/pith-number/JEQYXRUUGTEYYTP7J33URZDOGR/graph.json","events_json":"https://pith.science/api/pith-number/JEQYXRUUGTEYYTP7J33URZDOGR/events.json","paper":"https://pith.science/paper/JEQYXRUU"},"agent_actions":{"view_html":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR","download_json":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR.json","view_paper":"https://pith.science/paper/JEQYXRUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04134&json=true","fetch_graph":"https://pith.science/api/pith-number/JEQYXRUUGTEYYTP7J33URZDOGR/graph.json","fetch_events":"https://pith.science/api/pith-number/JEQYXRUUGTEYYTP7J33URZDOGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR/action/storage_attestation","attest_author":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR/action/author_attestation","sign_citation":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR/action/citation_signature","submit_replication":"https://pith.science/pith/JEQYXRUUGTEYYTP7J33URZDOGR/action/replication_record"}},"created_at":"2026-05-18T01:22:45.804397+00:00","updated_at":"2026-05-18T01:22:45.804397+00:00"}