{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DVGDISOYVIB5NPLHXIUKQZRTZI","short_pith_number":"pith:DVGDISOY","schema_version":"1.0","canonical_sha256":"1d4c3449d8aa03d6bd67ba28a86633ca0607772140ebf6a4b94d04e8d1ceff1b","source":{"kind":"arxiv","id":"1009.2476","version":1},"attestation_state":"computed","paper":{"title":"One software tool for testing square s-boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Nikolai Stoianov","submitted_at":"2010-09-13T19:01:11Z","abstract_excerpt":"An encryption technique is widely used to keep data confidential. Most of the block symmetric algorithms use substitution functions. Often this functions use so called S-BOX matrix. In this paper author presents one software tool for testing and measuring square s-boxes. Based of information theory functions for testing static and dynamic criteria are presented. These criteria are mathematically defined for square s-boxes. Two new criteria \"private criteria\" a proposed and pseudo codes for they creation and testing are presented."},"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":"1009.2476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-13T19:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"27e4f06f1f40a6258d992e3a45a53faee80acb3a3218ba16cfe81c4182f11c5a","abstract_canon_sha256":"9f4da8f18ffc3c8b93bb14587102655bd5b54757a737e94f545ec9e8d4322498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:04.191816Z","signature_b64":"oLVexiWyJlCow4JtoLtRDKt7lIkKbsGroDqrdH1+WAdyx2hDr2+3WlYxGBYdRI/Zg9FxlnO7L5w8LqSx08pODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d4c3449d8aa03d6bd67ba28a86633ca0607772140ebf6a4b94d04e8d1ceff1b","last_reissued_at":"2026-05-18T04:41:04.191406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:04.191406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One software tool for testing square s-boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Nikolai Stoianov","submitted_at":"2010-09-13T19:01:11Z","abstract_excerpt":"An encryption technique is widely used to keep data confidential. Most of the block symmetric algorithms use substitution functions. Often this functions use so called S-BOX matrix. In this paper author presents one software tool for testing and measuring square s-boxes. Based of information theory functions for testing static and dynamic criteria are presented. These criteria are mathematically defined for square s-boxes. Two new criteria \"private criteria\" a proposed and pseudo codes for they creation and testing are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2476","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":"1009.2476","created_at":"2026-05-18T04:41:04.191467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2476v1","created_at":"2026-05-18T04:41:04.191467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2476","created_at":"2026-05-18T04:41:04.191467+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVGDISOYVIB5","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVGDISOYVIB5NPLH","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVGDISOY","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/DVGDISOYVIB5NPLHXIUKQZRTZI","json":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI.json","graph_json":"https://pith.science/api/pith-number/DVGDISOYVIB5NPLHXIUKQZRTZI/graph.json","events_json":"https://pith.science/api/pith-number/DVGDISOYVIB5NPLHXIUKQZRTZI/events.json","paper":"https://pith.science/paper/DVGDISOY"},"agent_actions":{"view_html":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI","download_json":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI.json","view_paper":"https://pith.science/paper/DVGDISOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2476&json=true","fetch_graph":"https://pith.science/api/pith-number/DVGDISOYVIB5NPLHXIUKQZRTZI/graph.json","fetch_events":"https://pith.science/api/pith-number/DVGDISOYVIB5NPLHXIUKQZRTZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI/action/storage_attestation","attest_author":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI/action/author_attestation","sign_citation":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI/action/citation_signature","submit_replication":"https://pith.science/pith/DVGDISOYVIB5NPLHXIUKQZRTZI/action/replication_record"}},"created_at":"2026-05-18T04:41:04.191467+00:00","updated_at":"2026-05-18T04:41:04.191467+00:00"}