![[ INFO ]](../../images/menu/gif/welcome-normal.de.gif)
![[ PREPARE ]](../../images/menu/gif/prepare-normal.de.gif)
![[ @17C3 ]](../../images/menu/gif/today-normal.de.gif)
![[ FAHRPLAN ]](../../images/menu/gif/fahrplan-active.de.gif)
![[ ARCHIV ]](../../images/menu/gif/archive-normal.de.gif)
![[ vorträge ]](../../images/menu/gif/events-active.de.gif)
![[ referenten ]](../../images/menu/gif/speakers-normal.de.gif)
![[ tag 1 ]](../../images/menu/gif/day_TAG1-normal.de.gif)
![[ tag 2 ]](../../images/menu/gif/day_TAG2-normal.de.gif)
![[ tag 3 ]](../../images/menu/gif/day_TAG3-normal.de.gif)
Dynamic Secret Sharing Scheme based on Factoring and LaGrange Interpolating Polynomials
Referenten: Jon Erickson
Sprache: englisch
Beschreibung:
Jon Erickson will talk about Secret Sharing. Often called (t, n) threshold schemes, they allow a secret to be broken up into n parts, yet the combination of any of those t parts will recreate the original secret (t < n). The specifics will be talked about more, in addition to an explanation of George Blakley's Vector Scheme. Then finite field mathematics will be explained, including division in a finite field, using the extended Euclidian algorithm to solve the necessary Diophantine equation. Next building a polynomial from points using the LaGrange Interpolating Polynomial equation will be demonstrated, leading to Adi Shamir's Threshold Scheme. Time permitting, a dynamic version of Shamir's scheme will be explained.