Primality Proving via One Round in ECPP and One Iteration in AKS

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, a random primality proving algorithm is proposed, which generates prime certificate of length O(log n). The certificate can be verified in deterministic time O(log^4 n). The algorithm runs in heuristical time tilde{O}(log^4 n), some supporting evidences are provided.
10 pages, No figure

Keywords

Number Theory, 11Y11

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/66274

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0301179
 http://arxiv.org/abs/math/0301179

Collections

arXiv