{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JBGALB5WNZICJAATSSKSGRSS2V","short_pith_number":"pith:JBGALB5W","schema_version":"1.0","canonical_sha256":"484c0587b66e502480139495234652d57f2160ff5a585876e2b8e841875ae502","source":{"kind":"arxiv","id":"1502.00433","version":1},"attestation_state":"computed","paper":{"title":"Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Abdoul Aziz Ciss, Hortense Boudjou Tchapgnouo","submitted_at":"2015-02-02T10:44:01Z","abstract_excerpt":"This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields $\\mathbb{F}_{p^n}$, $G_1$ and $G_2$. We show that the least significant bits of a random element in $G_1*G_2$, are indistinguishable from a uniform bit-string of the same length.\n One of the main application of this extractor is to replace the use of hash functions in pairing by the use of a good deterministic randomness extractor."},"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":"1502.00433","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2015-02-02T10:44:01Z","cross_cats_sorted":[],"title_canon_sha256":"b7a5ed24165d348146f98e009cc59926fd4a1ddb466c767d10962429cfc2d786","abstract_canon_sha256":"d06b3714d37b45f2b3393831bacc40c578c81c471ce68fb27bd9e5bf5b4c5ea5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:06.003481Z","signature_b64":"MjdNt5H3+sw9lwd4zRAqgXbqAsNE9u+/qkZ77M2rX1wqMkl0qg/z99T3iDvkbM9NymS1yxaST5TKDD5LQfpjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"484c0587b66e502480139495234652d57f2160ff5a585876e2b8e841875ae502","last_reissued_at":"2026-05-18T02:28:06.003124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:06.003124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Abdoul Aziz Ciss, Hortense Boudjou Tchapgnouo","submitted_at":"2015-02-02T10:44:01Z","abstract_excerpt":"This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields $\\mathbb{F}_{p^n}$, $G_1$ and $G_2$. We show that the least significant bits of a random element in $G_1*G_2$, are indistinguishable from a uniform bit-string of the same length.\n One of the main application of this extractor is to replace the use of hash functions in pairing by the use of a good deterministic randomness extractor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00433","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":"1502.00433","created_at":"2026-05-18T02:28:06.003178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00433v1","created_at":"2026-05-18T02:28:06.003178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00433","created_at":"2026-05-18T02:28:06.003178+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBGALB5WNZIC","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBGALB5WNZICJAAT","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBGALB5W","created_at":"2026-05-18T12:29:27.538025+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/JBGALB5WNZICJAATSSKSGRSS2V","json":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V.json","graph_json":"https://pith.science/api/pith-number/JBGALB5WNZICJAATSSKSGRSS2V/graph.json","events_json":"https://pith.science/api/pith-number/JBGALB5WNZICJAATSSKSGRSS2V/events.json","paper":"https://pith.science/paper/JBGALB5W"},"agent_actions":{"view_html":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V","download_json":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V.json","view_paper":"https://pith.science/paper/JBGALB5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00433&json=true","fetch_graph":"https://pith.science/api/pith-number/JBGALB5WNZICJAATSSKSGRSS2V/graph.json","fetch_events":"https://pith.science/api/pith-number/JBGALB5WNZICJAATSSKSGRSS2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V/action/storage_attestation","attest_author":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V/action/author_attestation","sign_citation":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V/action/citation_signature","submit_replication":"https://pith.science/pith/JBGALB5WNZICJAATSSKSGRSS2V/action/replication_record"}},"created_at":"2026-05-18T02:28:06.003178+00:00","updated_at":"2026-05-18T02:28:06.003178+00:00"}