Factorization Algorithms for Polynomials over Finite Fields
Integer factorization is a dicult task. Some cryptosystem such asRSA (which stands for Rivest, Shamir and Adleman ) are in fact designedaround the diculty of integer factorization.For factorization of polynomials in a given nite eld Fp we can useBerlekamp's and Zassenhaus algorithms. In this pr...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM
2011
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-11553 |