Shamir's Secret Sharing on non-prime GF

Published: 12/08/2017
Shamir's Secret Sharing on non-prime GF
Source: CRYPTO.STACKEXCHANGE.COM

I am implementing Shamir's secret sharing scheme on arbitrary binary files. I don't intend to use this; this is a project to help me explore cryptography. In setting up the finite field arithmetic, I chose my field to be GF(257). My understanding is that a prime GF is needed to ensure that a single modular inverse exists for each value in the field (this conflicts with the answer to How can Sham

Read more
Related news
Comment