Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Kronecker Substitution

Numerical Algorithm

Kronecker substitution is a technique, named for the mathematician Leopold Kronecker, for determining the coefficients of an unknown polynomial by evaluating it at a single value chosen as a power of two larger than any coefficient, so the coefficients can be read directly out of the binary representation of the result. Because it reduces polynomial multiplication to a single large integer multiplication, the technique lets polynomial multiplication be performed in the time of one binary multiplication. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Sources
Wikipedia: Kronecker substitution
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.