Shamir's Secret Sharing
From Just Solve the File Format Problem
(Difference between revisions)
Dan Tobias (Talk | contribs) (Created page with "{{FormatInfo |formattype=electronic |subcat=Encryption |released=1979 }} '''Shamir's Secret Sharing''' is an algorithm created by Adi Shamir (an Israeli cryptographer) to brea...") |
Dan Tobias (Talk | contribs) |
||
| Line 3: | Line 3: | ||
|subcat=Encryption | |subcat=Encryption | ||
|released=1979 | |released=1979 | ||
| + | |wikidata={{wikidata|Q935125}} | ||
}} | }} | ||
'''Shamir's Secret Sharing''' is an algorithm created by Adi Shamir (an Israeli cryptographer) to break something into parts that can be reconstituted if at least some certain number of the parts (which might be less than all of them) are brought back together. It can be used for sharing a secret key in a way that requires multiple recipients to get together in order to do the decryption. [[Horcrux (jesseduffield)]] uses this algorithm for key splitting. | '''Shamir's Secret Sharing''' is an algorithm created by Adi Shamir (an Israeli cryptographer) to break something into parts that can be reconstituted if at least some certain number of the parts (which might be less than all of them) are brought back together. It can be used for sharing a secret key in a way that requires multiple recipients to get together in order to do the decryption. [[Horcrux (jesseduffield)]] uses this algorithm for key splitting. | ||
Latest revision as of 04:03, 22 August 2020
Shamir's Secret Sharing is an algorithm created by Adi Shamir (an Israeli cryptographer) to break something into parts that can be reconstituted if at least some certain number of the parts (which might be less than all of them) are brought back together. It can be used for sharing a secret key in a way that requires multiple recipients to get together in order to do the decryption. Horcrux (jesseduffield) uses this algorithm for key splitting.
