how to obtained faster gcd computation over large prime field. if f1 and f2 are two polynomial over large prime field ex. p=256 it takes lot of time to perform gcd(f1,f2). how to speed up this computation.
Revision history [back]
 | 1 | initial version |
