• search hit 3 of 8
Back to Result List

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

Share in Twitter Search Google Scholar
Author:Andreas Guthmann
URN (permanent link):urn:nbn:de:hbz:386-kluedo-50333
Serie (Series number):Preprints (rote Reihe) des Fachbereich Mathematik (216)
Document Type:Report
Language of publication:English
Publication Date:2017/11/06
Year of Publication:1992
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/11/06
Number of page:12
Faculties / Organisational entities: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)