Skip to content

Comment on Finite Field Arithmetic and Reed-Solomon Codingparent

Comments

Similar in principle to Reed-Solomon coding, we have Shamir's Secret Sharing:

http://en.wikipedia.org/wiki/Shamirs_Secret_Sharing

It lets you divide a message into (say) three parts, where any two parts are necessary and sufficient to reconstruct the message. Or into seven parts, where you need all the parts to reconstruct the message. Or whatever. The wikipedia page gives a very readable basic introduction to how it works.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.