{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X7XSA7FZMPWCHZZGQZFQY3IUIB","short_pith_number":"pith:X7XSA7FZ","schema_version":"1.0","canonical_sha256":"bfef207cb963ec23e726864b0c6d14407ebb13a58bd6c6c5229ffca85c2d3944","source":{"kind":"arxiv","id":"2405.07007","version":2},"attestation_state":"computed","paper":{"title":"A New Algorithm for Computing Branch Number of Non-Singular Matrices over Finite Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Atul Gaur, P.R. Mishra, Susanta Samanta, Yogesh Kumar","submitted_at":"2024-05-11T13:06:03Z","abstract_excerpt":"The notion of branch numbers of a linear transformation is crucial for both linear and differential cryptanalysis. The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The differential or linear branch number indicates the minimum number of active S-Boxes in two consecutive rounds of an SPN cipher, specifically for differential or linear cryptanalysis, respectively. This paper presents a new algorithm for computing the branch number of non-singular matrices over finite fields. The algorithm is based on the existing classical method b"},"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":"2405.07007","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-05-11T13:06:03Z","cross_cats_sorted":[],"title_canon_sha256":"9ae2b46a49c5d100d29f5d34be08e6fd9c5b45516ad73c717434a335996932ba","abstract_canon_sha256":"c54ed4a58ca33e64fa96c35558df9c84aa484a95e18b5608cd6f86a188753ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:59.404646Z","signature_b64":"nK0fyWHpbt/4pm3ucR2sNEySSS9t4X1curtoP6BO41ZpWvF7uca33ncH/ByCMzy3NMaA9YpUVsG6h/D9vn04Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfef207cb963ec23e726864b0c6d14407ebb13a58bd6c6c5229ffca85c2d3944","last_reissued_at":"2026-07-05T09:09:59.404208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:59.404208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Algorithm for Computing Branch Number of Non-Singular Matrices over Finite Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Atul Gaur, P.R. Mishra, Susanta Samanta, Yogesh Kumar","submitted_at":"2024-05-11T13:06:03Z","abstract_excerpt":"The notion of branch numbers of a linear transformation is crucial for both linear and differential cryptanalysis. The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The differential or linear branch number indicates the minimum number of active S-Boxes in two consecutive rounds of an SPN cipher, specifically for differential or linear cryptanalysis, respectively. This paper presents a new algorithm for computing the branch number of non-singular matrices over finite fields. The algorithm is based on the existing classical method b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.07007/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":"2405.07007","created_at":"2026-07-05T09:09:59.404265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07007v2","created_at":"2026-07-05T09:09:59.404265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07007","created_at":"2026-07-05T09:09:59.404265+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7XSA7FZMPWC","created_at":"2026-07-05T09:09:59.404265+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7XSA7FZMPWCHZZG","created_at":"2026-07-05T09:09:59.404265+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7XSA7FZ","created_at":"2026-07-05T09:09:59.404265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.12787","citing_title":"Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB","json":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB.json","graph_json":"https://pith.science/api/pith-number/X7XSA7FZMPWCHZZGQZFQY3IUIB/graph.json","events_json":"https://pith.science/api/pith-number/X7XSA7FZMPWCHZZGQZFQY3IUIB/events.json","paper":"https://pith.science/paper/X7XSA7FZ"},"agent_actions":{"view_html":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB","download_json":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB.json","view_paper":"https://pith.science/paper/X7XSA7FZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07007&json=true","fetch_graph":"https://pith.science/api/pith-number/X7XSA7FZMPWCHZZGQZFQY3IUIB/graph.json","fetch_events":"https://pith.science/api/pith-number/X7XSA7FZMPWCHZZGQZFQY3IUIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB/action/storage_attestation","attest_author":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB/action/author_attestation","sign_citation":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB/action/citation_signature","submit_replication":"https://pith.science/pith/X7XSA7FZMPWCHZZGQZFQY3IUIB/action/replication_record"}},"created_at":"2026-07-05T09:09:59.404265+00:00","updated_at":"2026-07-05T09:09:59.404265+00:00"}