Skip to content

Latest commit

 

History

History
21 lines (14 loc) · 531 Bytes

polynomials-with-shared-roots.md

File metadata and controls

21 lines (14 loc) · 531 Bytes
description
Algorithmic Number Theory

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!