{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HNM6KD2XIMBFQVCVYEDDCZFFEE","short_pith_number":"pith:HNM6KD2X","schema_version":"1.0","canonical_sha256":"3b59e50f574302585455c1063164a5212ff10e6f55955581dce6b44e29b82e00","source":{"kind":"arxiv","id":"1510.01234","version":1},"attestation_state":"computed","paper":{"title":"Hardware Random number Generator for cryptography","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CR","physics.ins-det"],"primary_cat":"physics.comp-ph","authors_text":"Ashok Vudayagiri, Madhuri K., Ram Soorat","submitted_at":"2015-10-05T17:04:08Z","abstract_excerpt":"One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is added to massage string to generate the encrypted code. It is represented as $C=M \\oplus K $ where $M$ is the message, $K$ is the key and $C$ is the ciphertext. It has been mathematically shown that this simple scheme is unbreakable is key K as long as M and is used only once. For a good cryptosystem, the security of the cryptosystem is not be based on keeping"},"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":"1510.01234","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2015-10-05T17:04:08Z","cross_cats_sorted":["cs.CR","physics.ins-det"],"title_canon_sha256":"90da3916bff83e94d66a79b370c739987f02ca41a317d9fbfe5f260cd2088a9e","abstract_canon_sha256":"7d55593132626bc544d8d1e624616adddc1b12a6b6279519c174ca0e3529748a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:04.496394Z","signature_b64":"7xId30GOXO65Y2RC5x1OCMO0VK9m5dl9XYgUO3ikK7h4YtlTpISqLP9yqghOFn+7sBrqN9s4Bu/Cwgy21eQ/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b59e50f574302585455c1063164a5212ff10e6f55955581dce6b44e29b82e00","last_reissued_at":"2026-05-18T01:31:04.495841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:04.495841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardware Random number Generator for cryptography","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CR","physics.ins-det"],"primary_cat":"physics.comp-ph","authors_text":"Ashok Vudayagiri, Madhuri K., Ram Soorat","submitted_at":"2015-10-05T17:04:08Z","abstract_excerpt":"One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is added to massage string to generate the encrypted code. It is represented as $C=M \\oplus K $ where $M$ is the message, $K$ is the key and $C$ is the ciphertext. It has been mathematically shown that this simple scheme is unbreakable is key K as long as M and is used only once. For a good cryptosystem, the security of the cryptosystem is not be based on keeping"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01234","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":"1510.01234","created_at":"2026-05-18T01:31:04.495923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01234v1","created_at":"2026-05-18T01:31:04.495923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01234","created_at":"2026-05-18T01:31:04.495923+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNM6KD2XIMBF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNM6KD2XIMBFQVCV","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNM6KD2X","created_at":"2026-05-18T12:29:25.134429+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/HNM6KD2XIMBFQVCVYEDDCZFFEE","json":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE.json","graph_json":"https://pith.science/api/pith-number/HNM6KD2XIMBFQVCVYEDDCZFFEE/graph.json","events_json":"https://pith.science/api/pith-number/HNM6KD2XIMBFQVCVYEDDCZFFEE/events.json","paper":"https://pith.science/paper/HNM6KD2X"},"agent_actions":{"view_html":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE","download_json":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE.json","view_paper":"https://pith.science/paper/HNM6KD2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01234&json=true","fetch_graph":"https://pith.science/api/pith-number/HNM6KD2XIMBFQVCVYEDDCZFFEE/graph.json","fetch_events":"https://pith.science/api/pith-number/HNM6KD2XIMBFQVCVYEDDCZFFEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE/action/storage_attestation","attest_author":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE/action/author_attestation","sign_citation":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE/action/citation_signature","submit_replication":"https://pith.science/pith/HNM6KD2XIMBFQVCVYEDDCZFFEE/action/replication_record"}},"created_at":"2026-05-18T01:31:04.495923+00:00","updated_at":"2026-05-18T01:31:04.495923+00:00"}