{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZZGCSBEXY6GSVATEDCJIXY6I34","short_pith_number":"pith:ZZGCSBEX","schema_version":"1.0","canonical_sha256":"ce4c290497c78d2a826418928be3c8df0d0db27a16df0696a386596d6b2d30e1","source":{"kind":"arxiv","id":"1205.1737","version":2},"attestation_state":"computed","paper":{"title":"A simple 1-byte 1-clock RC4 design and its efficient implementation in FPGA coprocessor for secured ethernet communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Amlan Chakrabarti, Jkm Sadique Uz Zaman, Ranjan Ghosh, Rourab Paul, Sangeet Saha, Suman Das","submitted_at":"2012-05-08T16:30:40Z","abstract_excerpt":"In the field of cryptography till date the 1-byte in 1-clock is the best known RC4 hardware design [1], while the 1-byte in 3clocks is the best known implementation [2,3]. The design algorithm in [1] considers two consecutive bytes together and processes them in 2 clocks. The design of 1-byte in 3-clocks is too much modular and clock hungry. In this paper considering the RC4 algorithm, as it is, a simpler RC4 hardware design providing higher throughput is proposed in which 1-byte is processed in 1-clock. In the design two sequential tasks are executed as two independent events during rising an"},"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.1737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2012-05-08T16:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"d0ec0ac6088c0c0aa2632aaf0505d2d53b92791169baa75df3119f02ea8cec22","abstract_canon_sha256":"f569f2da4814a8bacca0f1c6bd9cc3fe68b9c9d4b4bd8c0703ceaa33ea996443"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:59.544671Z","signature_b64":"ENdAqPkGSZ4LoB3ym+pGVTHhsw4SVU621vlZXvWKDuzYO5qSHWSD7LePb47d2Kic/ALCAKFPeSJnJvPKqVtzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce4c290497c78d2a826418928be3c8df0d0db27a16df0696a386596d6b2d30e1","last_reissued_at":"2026-05-18T03:49:59.544214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:59.544214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple 1-byte 1-clock RC4 design and its efficient implementation in FPGA coprocessor for secured ethernet communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Amlan Chakrabarti, Jkm Sadique Uz Zaman, Ranjan Ghosh, Rourab Paul, Sangeet Saha, Suman Das","submitted_at":"2012-05-08T16:30:40Z","abstract_excerpt":"In the field of cryptography till date the 1-byte in 1-clock is the best known RC4 hardware design [1], while the 1-byte in 3clocks is the best known implementation [2,3]. The design algorithm in [1] considers two consecutive bytes together and processes them in 2 clocks. The design of 1-byte in 3-clocks is too much modular and clock hungry. In this paper considering the RC4 algorithm, as it is, a simpler RC4 hardware design providing higher throughput is proposed in which 1-byte is processed in 1-clock. In the design two sequential tasks are executed as two independent events during rising an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1737","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":"1205.1737","created_at":"2026-05-18T03:49:59.544277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1737v2","created_at":"2026-05-18T03:49:59.544277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1737","created_at":"2026-05-18T03:49:59.544277+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZGCSBEXY6GS","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZGCSBEXY6GSVATE","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZGCSBEX","created_at":"2026-05-18T12:27:30.460161+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/ZZGCSBEXY6GSVATEDCJIXY6I34","json":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34.json","graph_json":"https://pith.science/api/pith-number/ZZGCSBEXY6GSVATEDCJIXY6I34/graph.json","events_json":"https://pith.science/api/pith-number/ZZGCSBEXY6GSVATEDCJIXY6I34/events.json","paper":"https://pith.science/paper/ZZGCSBEX"},"agent_actions":{"view_html":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34","download_json":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34.json","view_paper":"https://pith.science/paper/ZZGCSBEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1737&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZGCSBEXY6GSVATEDCJIXY6I34/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZGCSBEXY6GSVATEDCJIXY6I34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34/action/storage_attestation","attest_author":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34/action/author_attestation","sign_citation":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34/action/citation_signature","submit_replication":"https://pith.science/pith/ZZGCSBEXY6GSVATEDCJIXY6I34/action/replication_record"}},"created_at":"2026-05-18T03:49:59.544277+00:00","updated_at":"2026-05-18T03:49:59.544277+00:00"}