query: In Shamir's (t, n) secret sharing scheme why don't use infinite field?
positive_passages.docid: 23010
positive_passages.text: Why does Shamir's Secret Sharing Scheme need a finite field?
negative_passages.docid: 66789
negative_passages.text: Coefficients in Shamir's Secret Sharing Scheme
negative_passages.docid: 84116
negative_passages.text: When all shares of a secret are given to adversary as a permuted matrix
negative_passages.docid: 109614
negative_passages.text: Understanding the length extension attack
negative_passages.docid: 119686
negative_passages.text: Why do stream ciphers use a nonce?
negative_passages.docid: 80005
negative_passages.text: Does homomorphic encryption hide the algorithm itself?
negative_passages.docid: 2719
negative_passages.text: Why isn't an infinite direct product of copies of $\Bbb Z$ a free module?
negative_passages.docid: 118295
negative_passages.text: How is the no-cloning theorem compatible with the fact that fan-out gates work?
negative_passages.docid: 14479
negative_passages.text: Why is the access to a private field not forbidden?
negative_passages.docid: 53043
negative_passages.text: Checking if Unlimited Cryptography is available
negative_passages.docid: 66942
negative_passages.text: How does order-preserving encryption work?
negative_passages.docid: 55689
negative_passages.text: Why are the Davies-Meyer and Miyaguchi-Preneel constructions secure?
negative_passages.docid: 153210
negative_passages.text: Why is every Noetherian zero-dimensional scheme finite discrete?
negative_passages.docid: 46795
negative_passages.text: Explicit construction of a finite field with $p^n$ elements
negative_passages.docid: 39396
negative_passages.text: Breaking a small-scale Example Diffie-Hellman?
negative_passages.docid: 58029
negative_passages.text: Why is a Diffie-Hellman key exchange required when RSA is already being used for key exchange in TLS?
negative_passages.docid: 97347
negative_passages.text: Should HMAC-SHA3 be preferred over H(C(k,M))?