# Polynomials With Shared Roots * Polynomial GCD * Euclidean GCD * Half-GCD for speed when e=0x10001 * demo application for that one RSA related message attack? * Resultant * eliminate multivariate polynomials at the expense of increasing polynomial degree * demo application for that one RSA Coppersmith short padding related message attack? * Groebner Basis * what if you did GCD and Resultants at the same time, like whoa * and what if it took forever to run! --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://cryptohack.gitbook.io/cryptobook/polynomials-with-shared-roots.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.