The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Lalitha Kiran Nemana, V. Ch. Venkaiah
- IACR Cryptology ePrint Archive
- 2016

The AKS (Agrawal-Kayal-Saxena) algorithm is the first ever deterministic polynomialtime primality-proving algorithm whose… (More)

Is this relevant?

2015

2015

- Hing-Lun Chan, Michael Norrish
- ITP
- 2015

The AKS algorithm (by Agrawal, Kayal and Saxena) is a significant theoretical result proving “PRIMES in P”, as well as a… (More)

Is this relevant?

2013

2013

- Vijay Menon
- ArXiv
- 2013

Prime numbers play a very vital role in modern cryptography and especially the difficulties involved in factoring numbers… (More)

Is this relevant?

2013

2013

- Zhengjun Cao
- IACR Cryptology ePrint Archive
- 2013

We remark that AKS primality testing algorithm needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits… (More)

Is this relevant?

2007

2007

- Daniel J. Bernstein, Hendrik W. Lenstra, Jonathan Pila
- Math. Comput.
- 2007

This paper presents an algorithm that, given an integer n > 1, finds the largest integer k such that n is a kth power. A previous… (More)

Is this relevant?

2006

2006

- A. Gabriel W. Daleson
- 2006

The new Agrawal-Kayal-Saxena (AKS) algorithm determines whether a given number is prime or composite in polynomial time, but… (More)

Is this relevant?

2004

2004

In this paper we present a recursive implementation of the Agrawal, Kayal and Saxena primality testing algorithm, which is the… (More)

Is this relevant?

2003

2003

- Qi Cheng
- Journal of Cryptology
- 2003

In August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial-time primality-testing algorithm. For… (More)

Is this relevant?

2002

2002

Input: An integer n > 1. 0: if n is a power then output composite fi; 1: r := 2; 2: while (r < n) do 3: if gcd(r, n) 6= 1 then… (More)

Is this relevant?

2002

2002

- Martin Macaj
- 2002

We show that AKS-algorithm for primality testing ( see [1]) can be modified to run in Õ(log n) time. We present some remarks and… (More)

Is this relevant?