Refine
Document Type
- Report (4) (remove)
Language
- English (4) (remove)
Has Fulltext
- yes (4)
Faculty / Organisational entity
We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gauß sums leads to a much simpler approach to these primality criteria as compared to the earlier tests. The running time of the algorithms is bounded by a polynomial in the length of the input string. The applicability of our algorithms is linked to certain diophantine approximations of \(l\)-adic roots of unity.