{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GCLLCNKHFZ2PKAX5QL56ZHODX2","short_pith_number":"pith:GCLLCNKH","schema_version":"1.0","canonical_sha256":"3096b135472e74f502fd82fbec9dc3bebe19cc59b73fddfb770702fcdc13ce0c","source":{"kind":"arxiv","id":"1205.4279","version":1},"attestation_state":"computed","paper":{"title":"SD-AREE: A New Modified Caesar Cipher Cryptographic Method Along with Bit-Manipulation to Exclude Repetition from a Message to be Encrypted","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Somdip Dey","submitted_at":"2012-05-18T23:02:07Z","abstract_excerpt":"In this paper the author presents a new cryptographic technique to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm or try to retrieve the key, which is needed to encrypt a message, by analyzing the insertion or presence of repetitive bits / characters (bytes) in the message and encrypted message to find out the encryption algorithm or the key used for it. So it is mus"},"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":"1205.4279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-18T23:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"f1823d7a47f5514ce85cb808b550a38a3143f3507fbcfe05eaa9489f146a4835","abstract_canon_sha256":"342134dbe1eea2657cb12e2a0d44030297f34459763408e797564181f8ce9b47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:13.524431Z","signature_b64":"xOgtJwRDQU/EfZQ18tuTouYjCaeh712j56TRmzcGgsdVoJVMYbysl7+gbtgM+pKADF86Nc7ytEjmE5qk2KMIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3096b135472e74f502fd82fbec9dc3bebe19cc59b73fddfb770702fcdc13ce0c","last_reissued_at":"2026-05-18T03:55:13.523865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:13.523865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SD-AREE: A New Modified Caesar Cipher Cryptographic Method Along with Bit-Manipulation to Exclude Repetition from a Message to be Encrypted","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Somdip Dey","submitted_at":"2012-05-18T23:02:07Z","abstract_excerpt":"In this paper the author presents a new cryptographic technique to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm or try to retrieve the key, which is needed to encrypt a message, by analyzing the insertion or presence of repetitive bits / characters (bytes) in the message and encrypted message to find out the encryption algorithm or the key used for it. So it is mus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4279","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":"1205.4279","created_at":"2026-05-18T03:55:13.523944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4279v1","created_at":"2026-05-18T03:55:13.523944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4279","created_at":"2026-05-18T03:55:13.523944+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCLLCNKHFZ2P","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCLLCNKHFZ2PKAX5","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCLLCNKH","created_at":"2026-05-18T12:27:06.952714+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/GCLLCNKHFZ2PKAX5QL56ZHODX2","json":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2.json","graph_json":"https://pith.science/api/pith-number/GCLLCNKHFZ2PKAX5QL56ZHODX2/graph.json","events_json":"https://pith.science/api/pith-number/GCLLCNKHFZ2PKAX5QL56ZHODX2/events.json","paper":"https://pith.science/paper/GCLLCNKH"},"agent_actions":{"view_html":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2","download_json":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2.json","view_paper":"https://pith.science/paper/GCLLCNKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4279&json=true","fetch_graph":"https://pith.science/api/pith-number/GCLLCNKHFZ2PKAX5QL56ZHODX2/graph.json","fetch_events":"https://pith.science/api/pith-number/GCLLCNKHFZ2PKAX5QL56ZHODX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2/action/storage_attestation","attest_author":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2/action/author_attestation","sign_citation":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2/action/citation_signature","submit_replication":"https://pith.science/pith/GCLLCNKHFZ2PKAX5QL56ZHODX2/action/replication_record"}},"created_at":"2026-05-18T03:55:13.523944+00:00","updated_at":"2026-05-18T03:55:13.523944+00:00"}