The 12-word original mnemonic code was split using the Shamir Secret Sharing scheme with 3 out of 5 threshold schemes were used. This means that any three shares are sufficient to restore the original mnemonic code. The goal is to break the Shamir Secret Sharing scheme or break the implementation of software for SSSS. We publish 2 of 3 shares needed to restore the original mnemonics. Share 1: session cigar grape merry useful churn fatal thought very any arm unaware Share 2: clock fresh security field caution effort gorilla speed plastic common tomato echo
Did anyone try to solve the exercise (find f(0) for points f(3) = 2, f(4) = 1, f(5) = 2) in a GF(2^8) field? I got 108 and wonder if that's correct. ;)
luckily i held my exam for 2 years just to watch the next video :D
Excellent explanation. Thank you
The 12-word original mnemonic code was split using the Shamir Secret Sharing scheme with 3 out of 5 threshold schemes were used. This means that any three shares are sufficient to restore the original mnemonic code. The goal is to break the Shamir Secret Sharing scheme or break the implementation of software for SSSS. We publish 2 of 3 shares needed to restore the original mnemonics.
Share 1:
session
cigar
grape
merry
useful
churn
fatal
thought
very
any
arm
unaware
Share 2:
clock
fresh
security
field
caution
effort
gorilla
speed
plastic
common
tomato
echo
what
i would really like to see a finite field video!
You only had to wait 1 year! :D th-cam.com/video/ColSUxhpn6A/w-d-xo.html
Excellent video, do you know a source that explains multiparty computation as you did in the secret sharing?
Such a coincidence, I was just working on that this weekend: th-cam.com/video/_mDlLKgiFDY/w-d-xo.html
why did you wait 2 years to upload the solution lol
thanks
Did anyone try to solve the exercise (find f(0) for points f(3) = 2, f(4) = 1, f(5) = 2) in a GF(2^8) field? I got 108 and wonder if that's correct. ;)