query: (n,n) Shamir secret sharing
positive_passages.docid: 24821
positive_passages.text: Shamir Secret sharing - Can share generator keep x values secret?
negative_passages.docid: 36747
negative_passages.text: $\text{Tor}_0^R(M,N)\simeq M\otimes_R N$
negative_passages.docid: 37012
negative_passages.text: The number of summands $\phi(n)$
negative_passages.docid: 10998
negative_passages.text: Embedding $S_n$ in $A_{2n}$
negative_passages.docid: 22599
negative_passages.text: Using a Hash as a secure PRNG
negative_passages.docid: 138601
negative_passages.text: There are $2n+1$ people. For each $n$ people there is somebody who is friend with each of them. Prove there is a "know-them-all" person.
negative_passages.docid: 82438
negative_passages.text: How to combine symmetric and asymmetric encryption?
negative_passages.docid: 118757
negative_passages.text: RSA leak bits to factor N
negative_passages.docid: 66942
negative_passages.text: How does order-preserving encryption work?
negative_passages.docid: 133867
negative_passages.text: Security proofs for CBC mode
negative_passages.docid: 18141
negative_passages.text: Embedding $S_n$ into $A_{n+2}$
negative_passages.docid: 12035
negative_passages.text: XOR cipher with fixed key and known relation among plaintexts
negative_passages.docid: 121251
negative_passages.text: Do known-plaintext attacks exist for public key encryption?
negative_passages.docid: 146204
negative_passages.text: Subsets sharing at most $i$ elements
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function
negative_passages.docid: 70064
negative_passages.text: Computational complexity of RSA
negative_passages.docid: 14827
negative_passages.text: RSA: Fast factorization of N if d and e are known