Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2019-04-28 01:53:33 +0200 | received badge | ● Famous Question (source) |
| 2019-01-17 20:28:07 +0200 | received badge | ● Notable Question (source) |
| 2018-06-28 12:06:50 +0200 | received badge | ● Popular Question (source) |
| 2017-11-23 15:04:05 +0200 | asked a question | Lagrange interpolation over a finite field Sorry if this is obvious I am not a mathematician and am only trying to do this to learn about Samir's Secret Sharing scheme which uses a finite field for security. I've read the Sage doc here on univariate polynomial rings which works fine. but now I am curious as to how this would be done over a finite field instead in sage? Is it simply a matter of every point being taken mod some prime? Or would this not work. |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.