Preprints (rote Reihe) des Fachbereich Mathematik
Filtern
Erscheinungsjahr
- 1992 (3) (entfernen)
Dokumenttyp
- Bericht (3)
Volltext vorhanden
- ja (3)
Fachbereich / Organisatorische Einheit
216
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.
219
A Remark on Primes of the Form \(2^{3n}a + 2^{2n}b+2^nc+1\). Necessary and sufficient conditions for the numbers in the title to be prime are given. The tests are well suited for practical purposes.
218