Primality Testing
Prashant Pandey (97246) and Rajat Bhattacharjee (97264), April,
2001
In this project, we devised a deterministic polynomial time algorithm for
primality testing. Such an algorithm would have a lot of application in
fields like cryptography apart from the theoretical importance of the algorithm.
The correctness of the algorithm is yet to be proved. The algorithm is
based on a conjecture which has been verified extensively for large
numbers. The report also mentions some small steps that we have taken towards
proving the conjectire. We studied the structure of Z_n[x]/r(x). Here we
were able to prove some interesting results.
Full Report (PS-gzipped: 120K)
Back to the list of BTP reports