Primality Proving via One Round in ECPP and One Iteration in AKS
| dc.creator | Cheng, Qi | |
| dc.date | 2003-01-16 | |
| dc.date.accessioned | 2026-07-07T04:54:29Z | |
| dc.date.available | 2026-07-07T04:54:29Z | |
| dc.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. | |
| dc.description | 10 pages, No figure | |
| dc.identifier | https://arxiv.org/abs/math/0301179 | |
| dc.identifier | http://arxiv.org/abs/math/0301179 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66274 | |
| dc.subject | Number Theory | |
| dc.subject | 11Y11 | |
| dc.title | Primality Proving via One Round in ECPP and One Iteration in AKS | |
| dc.type | text |