{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4LCURPH62NEQR75GTUOGV3IIM3","short_pith_number":"pith:4LCURPH6","schema_version":"1.0","canonical_sha256":"e2c548bcfed34908ffa69d1c6aed0866e19c1f7cb18ba3e3211ce2adc07e103e","source":{"kind":"arxiv","id":"1110.1193","version":2},"attestation_state":"computed","paper":{"title":"A new class of codes for Boolean masking of cryptographic computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude Carlet, Jon-Lark Kim, Patrick Sol\\'e, Philippe Gaborit","submitted_at":"2011-10-06T09:13:07Z","abstract_excerpt":"We introduce a new class of rate one-half binary codes: {\\bf complementary information set codes.} A binary linear code of length $2n$ and dimension $n$ is called a complementary information set code (CIS code for short) if it has two disjoint information sets. This class of codes contains self-dual codes as a subclass. It is connected to graph correlation immune Boolean functions of use in the security of hardware implementations of cryptographic primitives. Such codes permit to improve the cost of masking cryptographic algorithms against side channel attacks. In this paper we investigate thi"},"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":"1110.1193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-06T09:13:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f5631795317a1da0f0fcd28ff8687406a385f63df9972ece94e4c51a47a9b4a","abstract_canon_sha256":"6b1f19b597c3ef7c807954c77803a3908c8f630aff2c2aed369def78a15ac4c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.108429Z","signature_b64":"MK6FmySqdLvpB3YUFIovu+0LhJkpCrzm2boMFfigeXS2Oh0CVApH0Kg2qhMd89JN16EYvOXzQRetp23pOka9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2c548bcfed34908ffa69d1c6aed0866e19c1f7cb18ba3e3211ce2adc07e103e","last_reissued_at":"2026-05-18T00:59:10.107824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.107824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new class of codes for Boolean masking of cryptographic computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude Carlet, Jon-Lark Kim, Patrick Sol\\'e, Philippe Gaborit","submitted_at":"2011-10-06T09:13:07Z","abstract_excerpt":"We introduce a new class of rate one-half binary codes: {\\bf complementary information set codes.} A binary linear code of length $2n$ and dimension $n$ is called a complementary information set code (CIS code for short) if it has two disjoint information sets. This class of codes contains self-dual codes as a subclass. It is connected to graph correlation immune Boolean functions of use in the security of hardware implementations of cryptographic primitives. Such codes permit to improve the cost of masking cryptographic algorithms against side channel attacks. In this paper we investigate thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1193","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":"1110.1193","created_at":"2026-05-18T00:59:10.107938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1193v2","created_at":"2026-05-18T00:59:10.107938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1193","created_at":"2026-05-18T00:59:10.107938+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/4LCURPH62NEQR75GTUOGV3IIM3","json":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3.json","graph_json":"https://pith.science/api/pith-number/4LCURPH62NEQR75GTUOGV3IIM3/graph.json","events_json":"https://pith.science/api/pith-number/4LCURPH62NEQR75GTUOGV3IIM3/events.json","paper":"https://pith.science/paper/4LCURPH6"},"agent_actions":{"view_html":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3","download_json":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3.json","view_paper":"https://pith.science/paper/4LCURPH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1193&json=true","fetch_graph":"https://pith.science/api/pith-number/4LCURPH62NEQR75GTUOGV3IIM3/graph.json","fetch_events":"https://pith.science/api/pith-number/4LCURPH62NEQR75GTUOGV3IIM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3/action/storage_attestation","attest_author":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3/action/author_attestation","sign_citation":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3/action/citation_signature","submit_replication":"https://pith.science/pith/4LCURPH62NEQR75GTUOGV3IIM3/action/replication_record"}},"created_at":"2026-05-18T00:59:10.107938+00:00","updated_at":"2026-05-18T00:59:10.107938+00:00"}