A generalization of proth's theorem

  • 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.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Andreas Guthmann
URN:urn:nbn:de:hbz:386-kluedo-50333
Series (Serial Number):Preprints (rote Reihe) des Fachbereich Mathematik (216)
Document Type:Report
Language of publication:English
Date of Publication (online):2017/11/06
Year of first Publication:1992
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/11/06
Page Number:12
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)